Nonbonding Orbitals in Fullerenes: Nuts and Cores in Singular Polyhedral Graphs

A zero eigenvalue in the spectrum of the adjacency matrix of the graph representing an unsaturated carbon framework indicates the presence of a nonbonding pi orbital (NBO). A graph with at least one zero in the spectrum is singular; nonzero entries in the corresponding zero-eigenvalue eigenvector(s) (kernel eigenvectors) identify the core vertices. A nut graph has a single zero in its adjacency spectrum with a corresponding eigenvector for which all vertices lie in the core. Balanced and uniform trivalent (cubic) nut graphs are defined in terms of (-2, +1, +1) patterns of eigenvector entries around all vertices. In balanced nut graphs all vertices have such a pattern up to a scale factor; uniform nut graphs are balanced with scale factor one for every vertex. Nut graphs are rare among small fullerenes (41 of the 10 190 782 fullerene isomers on up to 120 vertices) but common among the small trivalent polyhedra (62 043 of the 398 383 nonbipartite polyhedra on up to 24 vertices). Two constructions are described, one that is conjectured to yield an infinite series of uniform nut fullerenes, and another that is conjectured to yield an infinite series of cubic polyhedral nut graphs. All hypothetical nut fullerenes found so far have some pentagon adjacencies: it is proved that all uniform nut fullerenes must have such adjacencies and that the NBO is totally symmetric in all balanced nut fullerenes. A single electron placed in the NBO of a uniform nut fullerene gives a spin density distribution with the smallest possible (4:1) ratio between most and least populated sites for an NBO. It is observed that, in all nut-fullerene graphs found so far, occupation of the NBO would require the fullerene to carry at least 3 negative charges, whereas in most carbon cages based on small nut cubic polyhedra, the NBO would be the highest occupied molecular orbital (HOMO) for the uncharged system.

[1]  Irene Sciriha On the Rank of Graphs 1 , 1999 .

[2]  Patrick W. Fowler,et al.  Carbon cylinders: a class of closed-shell clusters , 1990 .

[3]  Branko Grünbaum,et al.  The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra , 1963, Canadian Journal of Mathematics.

[4]  Ivan Gutman,et al.  Minimal configuration trees , 2006 .

[5]  Patrick W. Fowler,et al.  On nut and core singular fullerenes , 2008, Discret. Math..

[6]  P. Fowler,et al.  Molecular graphs, point groups, and fullerenes , 1992 .

[7]  Andreas W. M. Dress,et al.  A Constructive Enumeration of Fullerenes , 1997, J. Algorithms.

[8]  P. W. Fowler Fullerene graphs with more negative than positiveeigenvalues: The exceptions that prove the rule of electrondeficiency? , 1997 .

[9]  Patrick W. Fowler,et al.  The electronic structure of polyhex carbon tori , 2000 .

[10]  Arnout Ceulemans,et al.  Electron Deficiency of the Fullerenes , 1995 .

[11]  Irene Sciriha,et al.  Minimal configurations and interlacing , 2005 .

[12]  Patrick W. Fowler,et al.  Fullerenes as Tilings of Surfaces , 2000, J. Chem. Inf. Comput. Sci..

[13]  Patrick W. Fowler,et al.  Non-bonding orbitals in graphite, carbon tubules, toroids andfullerenes , 1997 .

[14]  H. C. Longuet-Higgins,et al.  Some Studies in Molecular Orbital Theory I. Resonance Structures and Molecular Orbitals in Unsaturated Hydrocarbons , 1950 .

[15]  Patrick W. Fowler,et al.  QUATERNIONS AND EQUIDISTRIBUTIVE EIGENVECTORS OF SYMMETRIC GRAPHS , 1998 .

[16]  Irene Sciriha On the construction of graphs of nullity one , 1998, Discret. Math..

[17]  B. McKay,et al.  Fast generation of planar graphs , 2007 .

[18]  Patrick W. Fowler,et al.  Energetics of C20 and C22 Fullerene and Near‐Fullerene Carbon Cages , 1998 .