Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
From MaRDI portal
(Redirected from Publication:830874)
Abstract: After Curl, Kroto and Smalley were awarded 1996 the Nobel Prize in chemistry, fullerenes have been subject of much research. One part of that research is the prediction of a fullerene's stability using topological descriptors. It was mainly done by considering the distribution of the twelve pentagonal facets on its surface, calculations mostly were performed on all isomers of and . This paper suggests a novel method for the classification of combinatorial fullerene isomers using spectral graph theory. The classification presupposes an invariant scheme for the facets based on the Schlegel diagram. The main idea is to find clusters of isomers by analyzing their graph structure of hexagonal facets only. We also show that our classification scheme can serve as a formal stability criterion, which became evident from a comparison of our results with recent quantum chemical calculations. We apply our method to classify all isomers of and give an example of two different cospectral isomers of . Calculations are done with MATLAB. The only input for our algorithm is the vector of positions of pentagons in the facet spiral. These vectors and Schlegel diagrams are generated with the software package Fullerene.
Recommendations
Cites work
- scientific article; zbMATH DE number 1260617 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- A combinatorial approach to matrix theory and its applications
- An introduction to the theory of graph spectra
- Can One Hear the Shape of a Drum?
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- Convex Polytopes
- Fullerenes, polytopes and toric topology
- Graphs and matrices
- House of Graphs: a database of interesting graphs
- Mathematical aspects of fullerenes
- On the growth rate of the number of fullerenes
- On topological indices of fullerenes
- Spectra of graphs
- The largest eigenvalue of a graph: A survey
- Valency-based topological descriptors of chemical networks and their applications
- Which graphs are determined by their spectrum?
This page was built for publication: Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830874)