Finding more perfect matchings in leapfrog fullerenes

DOI10.1007/s10910-008-9435-yzbMath1196.92048OpenAlexW2024159613MaRDI QIDQ839358

Tomislav Došlić

Publication date: 2 September 2009

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

Full work available at URL: https://doi.org/10.1007/s10910-008-9435-y

zbMATH Keywords

Fibonacci numbersperfect matchingfullerene graphleapfrog fullerene

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (3)

Leapfrog fullerenes and Wiener index ⋮ Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs ⋮ Packing resonant hexagons in fullerenes

Cites Work

• On the number of Kekulé structures in capped zigzag nanotubes
• A note on the cyclical edge-connectivity of fullerene graphs
• Leapfrog fullerenes have many perfect matchings
• On cyclic edge-connectivity of fullerenes
• Fullerene graphs with exponentially many perfect matchings
• Matching theory
• 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
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding more perfect matchings in leapfrog fullerenes