The isolated-pentagon rule and nice substructures in fullerenes

DOI10.26493/1855-3974.1359.B33zbMath1411.05221OpenAlexW2891038597WikidataQ129294434 ScholiaQ129294434MaRDI QIDQ4629560

Hao Li, Heping Zhang

Publication date: 27 March 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1359.b33

zbMATH Keywords

stabilityfullereneKekulé structurepatchcyclic edge-cutconjugated cycleisolated pentagon rule

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (6)

Nice pairs of disjoint pentagons in fullerene graphs ⋮ Nice pairs of odd cycles in fullerene graphs ⋮ Shortest perfect pseudomatchings in fullerene graphs ⋮ The fullerene graphs with a perfect star packing ⋮ Characterizing the fullerene graphs with the minimum forcing number 3 ⋮ Removable and forced subgraphs of graphs

Cites Work

• Unnamed Item
• A note on the cyclical edge-connectivity of fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Pentagon-hexagon-patches with short boundaries
• New lower bound on the number of perfect matchings in fullerene graphs
• On some structural properties of fullerene graphs
• Mathematical aspects of fullerenes
• On the 2-Resonance of Fullerenes
• Onk-Resonant Fullerene Graphs
• On the anti-forcing number of fullerene graphs
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• The Factorization of Linear Graphs

This page was built for publication: The isolated-pentagon rule and nice substructures in fullerenes