On decompositions of leapfrog fullerenes

DOI10.1007/s10910-008-9414-3zbMath1165.92324OpenAlexW2093719930MaRDI QIDQ1029758

Dragan Marušič, Klavdija Kutnar, Damir Vukičević

Publication date: 13 July 2009

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

Full work available at URL: https://doi.org/10.1007/s10910-008-9414-3

zbMATH Keywords

graphperfect matchingscyclic edge-connectivityfullerene graphleapfrog operation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)

Cites Work

• On cyclic edge-connectivity of fullerenes
• 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
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians

This page was built for publication: On decompositions of leapfrog fullerenes