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
AbstractWe explore the relationship between Kekulé structures and maximum face independence sets in ...
A fullerene is a carbon molecule where each carbon atom is chemically bonded to three other carbon a...
A molecular graph M is a simple graph in which atoms and chemical bonds are the vertices and edges o...
Abstract. A fullerene is a trivalent (valency three), convex polyhedron with only convex pentagonal ...
AbstractRecently, the graph theoretic independence number has been linked to fullerene stability [S....
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
AbstractWe explore the structure of the maximum vertex independence sets in fullerenes: plane trival...
Abstract. Three possible stability measures are considered for fullerene cages: the Wiener index, a ...
Abstract. A fullerene graph is a cubic bridgeless plane graph with all faces of size 5 and 6. We sho...
C76 has 19151 possible fullerene structural isomers of which up to 55 are compatible with the experi...
For a given size of one fullerene molecule, there could exist many different isomers and their energ...
Optimisation of geometries of all 40 fullerene isomers of C40, using methods from molecular mechanic...
Semi-empirical and ab initio calculations are reported for the five C<sub>78</sub> fullerenes with i...
Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces, while all o...
Abstract The recently developed idea of analyzing complex networks in terms of node displacement due...
AbstractWe explore the relationship between Kekulé structures and maximum face independence sets in ...
A fullerene is a carbon molecule where each carbon atom is chemically bonded to three other carbon a...
A molecular graph M is a simple graph in which atoms and chemical bonds are the vertices and edges o...
Abstract. A fullerene is a trivalent (valency three), convex polyhedron with only convex pentagonal ...
AbstractRecently, the graph theoretic independence number has been linked to fullerene stability [S....
International audienceFullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentago...
AbstractWe explore the structure of the maximum vertex independence sets in fullerenes: plane trival...
Abstract. Three possible stability measures are considered for fullerene cages: the Wiener index, a ...
Abstract. A fullerene graph is a cubic bridgeless plane graph with all faces of size 5 and 6. We sho...
C76 has 19151 possible fullerene structural isomers of which up to 55 are compatible with the experi...
For a given size of one fullerene molecule, there could exist many different isomers and their energ...
Optimisation of geometries of all 40 fullerene isomers of C40, using methods from molecular mechanic...
Semi-empirical and ab initio calculations are reported for the five C<sub>78</sub> fullerenes with i...
Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces, while all o...
Abstract The recently developed idea of analyzing complex networks in terms of node displacement due...
AbstractWe explore the relationship between Kekulé structures and maximum face independence sets in ...
A fullerene is a carbon molecule where each carbon atom is chemically bonded to three other carbon a...
A molecular graph M is a simple graph in which atoms and chemical bonds are the vertices and edges o...