On nut and core singular fullerenes

Abstract: A graph G is singular of nullity , if its adjacency matrix is singular, with the eigenvalue zero of multiplicity . A singular graph having a 0-eigenvector, , 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 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. [Copyright &y& Elsevier]