Hexagonal resonance of (3,6)-fullerenes
From MaRDI portal
Publication:424211
DOI10.1007/s10910-011-9910-8zbMath1238.92072MaRDI QIDQ424211
Publication date: 31 May 2012
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-011-9910-8
05C90: Applications of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Related Items
On the anti-Kekulé problem of cubic graphs, Automorphism group and fixing number of \((3,6)\)- and \((4,6)\)-fullerene graphs, The anti-Kekulé number of graphs, On bicriticality of (3,6)-fullerene graphs, Restricted 2-extendability of (3,6)-fullerenes, Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces, 2-resonant fullerenes, Distance Under Symmetry: (3,6)-Fullerenes
Cites Work
- 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
- Maximal resonance of cubic bipartite polyhedral graphs
- Maximally resonant polygonal systems
- A complete characterization for \(k\)-resonant Klein-bottle polyhexes
- \(k\)-resonant toroidal polyhexes
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
- Spectra of toroidal graphs
- When each hexagon of a hexagonal system covers it
- Generalized hexagonal systems with each hexagon being resonant
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- Geometry and topology induced electronic properties of graphene derived quantum systems
- \(k\)-resonance of open-ended carbon nanotubes
- Plane elementary bipartite graphs
- \(k\)-resonance in toroidal polyhexes
- Onk-Resonant Fullerene Graphs
- A class of Hamiltonian polytopes
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
- The Factorization of Linear Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item