AbstractA graph G is singular of nullity η(>0), if its adjacency matrix A is singular, with the eigenvalue zero of multiplicity η. A singular graph having a 0-eigenvector, x, with no zero entries, is called a core graph. We place particular emphasis on nut graphs, namely the core graphs of nullity one. Through symmetry considerations of the automorphism group of the graph, we study relations among the entries of x which lead to interesting implications in chemistry. The zero eigenvalue is rare in a fullerene graph. We show that there are possible nut fullerenes with relatively simple structures
Fullerene graphs are trivalent plane graphs with only hexagonal and pentagonal faces. They are often...
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
A graph G is singular of nullity η if the nullspace of its adjacency matrix G has dimension η. Such ...
AbstractA graph G is singular of nullity η(>0), if its adjacency matrix A is singular, with the eige...
A nut graph has a non-invertible (singular) 0-1 adjacency matrix with non-zero entries in every kern...
A zero eigenvalue in the spectrum of the adjacency matrix of the graph representing an unsaturated c...
A nut graph is a graph on at least 2 vertices whose adjacency matrix has nullity 1 and for which non...
summary:The nullity of a graph $G$ is the multiplicity of zero as an eigenvalue in the spectrum of i...
AbstractThis paper studies singular graphs by considering minimal singular induced subgraphs of smal...
The energy of a molecular graph G is defined as the summation of the absolute values of the eigenval...
AbstractWe discuss means of constructing fullerene graphs from their eigenvalues and angles. An algo...
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no ze...
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linea...
12 pagesInternational audienceA fullerene graph is a cubic bridgeless plane graph with all faces of ...
A molecular graph M is a simple graph in which atoms and chemical bonds are the vertices and edges o...
Fullerene graphs are trivalent plane graphs with only hexagonal and pentagonal faces. They are often...
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
A graph G is singular of nullity η if the nullspace of its adjacency matrix G has dimension η. Such ...
AbstractA graph G is singular of nullity η(>0), if its adjacency matrix A is singular, with the eige...
A nut graph has a non-invertible (singular) 0-1 adjacency matrix with non-zero entries in every kern...
A zero eigenvalue in the spectrum of the adjacency matrix of the graph representing an unsaturated c...
A nut graph is a graph on at least 2 vertices whose adjacency matrix has nullity 1 and for which non...
summary:The nullity of a graph $G$ is the multiplicity of zero as an eigenvalue in the spectrum of i...
AbstractThis paper studies singular graphs by considering minimal singular induced subgraphs of smal...
The energy of a molecular graph G is defined as the summation of the absolute values of the eigenval...
AbstractWe discuss means of constructing fullerene graphs from their eigenvalues and angles. An algo...
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no ze...
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linea...
12 pagesInternational audienceA fullerene graph is a cubic bridgeless plane graph with all faces of ...
A molecular graph M is a simple graph in which atoms and chemical bonds are the vertices and edges o...
Fullerene graphs are trivalent plane graphs with only hexagonal and pentagonal faces. They are often...
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
A graph G is singular of nullity η if the nullspace of its adjacency matrix G has dimension η. Such ...