Leapfrog fullerenes have many perfect matchings

DOI10.1007/s10910-007-9287-xzbMath1379.92045OpenAlexW2079909368MaRDI QIDQ937674

Tomislav Došlić

Publication date: 15 August 2008

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-007-9287-x

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Protein sequences, DNA sequences (92D20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (5)

Finding more perfect matchings in leapfrog fullerenes ⋮ Fullerene graphs have exponentially many perfect matchings ⋮ Leapfrog fullerenes and Wiener index ⋮ Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs ⋮ Packing resonant hexagons in fullerenes

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of Kekulé structures in capped zigzag nanotubes
• Kekulé structures and the face independence number of a fullerene
• On conjectures of Graffiti
• An upper bound for the Clar number of fullerene graphs
• Fullerene graphs with exponentially many perfect matchings
• On lower bounds of number of perfect matchings in fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• New lower bound on the number of perfect matchings in fullerene graphs
• On some structural properties of fullerene graphs
• Independent sets in triangle-free cubic planar graphs
• The independence numbers of fullerenes and benzenoids
• The chirality of icosahedral fullerenes: a comparison of the tripling (leapfrog), quadrupling (chamfering), and septupling (capra) transformations
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

This page was built for publication: Leapfrog fullerenes have many perfect matchings