Graph-Theoretic Independence as a Predictor of Fullerene Stability
نویسندگان
چکیده
The independence number of the graph of a fullerene, the size of the largest set of vertices such that no two are adjacent (corresponding to the largest set of atoms of the molecule, no pair of which are bonded), appears to be a useful selector in identifying stable fullerene isomers. The experimentally characterized isomers with 60, 70 and 76 atoms uniquely minimize this number among the classes of possible structures with, respectively, 60, 70 and 76 atoms. Other experimentally characterized isomers also rank extremely low with respect to this invariant. These findings were initiated by a conjecture of the computer program Graffiti.
منابع مشابه
Nowhere dense graph classes, stability, and the independence property
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the earlier stability theoretic notion of superflatness. For subgraph-closed classes of graphs we prove equivalence to stability and to not having the independence pr...
متن کاملOdd Cycle Transversals and Independent Sets in Fullerene Graphs
A fullerene graph is a cubic bridgeless plane graph with all faces of size 5 and 6. We show that every fullerene graph on n vertices can be made bipartite by deleting at most √ 12n/5 edges, and has an independent set with at least n/2 − √ 3n/5 vertices. Both bounds are sharp, and we characterise the extremal graphs. This proves conjectures of Došlić and Vukičević, and of Daugherty. We deduce tw...
متن کاملOn the Diameter and Some Related Invariants of Fullerene Graphs∗
Fullerene graphs are 3-connected 3-regular planar graphs with only pentagonal and hexagonal faces. We show that the diameter of a fullerene graph G of order n is at least √ 24n−15−3 6 and at most n/5 + 1. Moreover, if G is not a (5, 0)-nanotube its diameter is at most n/6+5/2. As a consequence, we improve the upper bound on the saturation number of fullerene graphs. We also report an improved l...
متن کاملTotally symmetric Kekulé structures in fullerene graphs with ten or more symmetries
(Received May 2, 2012) Graph theoretic fullerenes are designed to model large carbon molecules: each vertex represents a carbon atom and the edges represent chemical bonds. A totally symmetric Kekulé structure in a fullerene is a set of independent edges which is fixed by all symmetries of the fullerene. It was suggested in a paper by S.J.Austin, J.Baker, P.W.Fowler, D.E.Manolopoulos and in a p...
متن کاملSome results on the complement of a new graph associated to a commutative ring
The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...
متن کامل