Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
From MaRDI portal
Publication:830874
DOI10.1007/s10910-020-01193-4zbMath1466.92245arXiv1910.00846OpenAlexW2977256489MaRDI QIDQ830874
Artur Bille, Evgueni Spodarev, Victor M. Buchstaber
Publication date: 10 May 2021
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.00846
eigenvalueconvex polytopeadjacency matrixfullerenedual graph\(C_{60}\)combinatorial isomerfacet spectrum
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- On topological indices of fullerenes
- Which graphs are determined by their spectrum?
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- House of Graphs: a database of interesting graphs
- Valency-based topological descriptors of chemical networks and their applications
- Mathematical aspects of fullerenes
- Convex Polytopes
- FULLERENES, POLYTOPES AND TORIC TOPOLOGY
- The largest eigenvalue of a graph: A survey
- On the growth rate of the number of fullerenes
- Can One Hear the Shape of a Drum?
- Graphs and matrices
This page was built for publication: Spectral clustering of combinatorial fullerene isomers based on their facet graph structure