New lower bound on the number of perfect matchings in fullerene graphs

DOI10.1023/A:1015131912706MaRDI QIDQ1600673zbMATH OpenFDO

Authors Heping Zhang, Fuji Zhang

Publication date 16 June 2002

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

Full work available at URL http://ir.lzu.edu.cn/handle/262010/117598

zbMATH Keywords

2-extendable graphbicritical graphfullereneKekule structureperfect matching

Mathematics Subject Classification ID

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

Recommendations

• On lower bounds of number of perfect matchings in fullerene graphs
• The lower bound of Kekulé count of fullerenes
• Fullerene graphs with exponentially many perfect matchings
• scientific article; zbMATH DE number 1833087
• On some structural properties of fullerene graphs

Cited in

(41)

• 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
• Fullerene graphs with exponentially many perfect matchings
• On decompositions of leapfrog fullerenes
• On lower bounds of number of perfect matchings in fullerene graphs
• Distance-restricted matching extendability of fullerene graphs
• On bicriticality of (3,6)-fullerene graphs
• Minimum size of n-factor-critical graphs and k-extendable graphs
• Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
• Restricted 2-extendability of (3,6)-fullerenes
• Shortest perfect pseudomatchings in fullerene graphs
• On some structural properties of generalized fullerene graphs with 13 pentagonal faces
• 2-resonant fullerenes
• Matchings in m-generalized fullerene graphs
• On Certain Graph Theory Applications
• The isolated-pentagon rule and nice substructures in fullerenes
• scientific article; zbMATH DE number 1833087 (Why is no real title available?)
• The fullerene graphs with a perfect star packing
• Nice pairs of pentagons in chamfered fullerenes
• The lower bound of Kekulé count of fullerenes
• A lower bound on the number of perfect matchings in benzenoid systems
• 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes
• scientific article; zbMATH DE number 6274836 (Why is no real title available?)
• scientific article; zbMATH DE number 6282162 (Why is no real title available?)
• A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs
• Long cycles in fullerene graphs
• Fullerenes with the maximum Clar number
• On the number of perfect star packing and perfect pseudo matching in some fullerene graphs
• Cyclic edge and cyclic vertex connectivity of (4, 5, 6)-fullerene graphs
• The AVD-total chromatic number of fullerene molecular graphs
• The anti-Kekulé number of graphs
• Nice pairs of disjoint pentagons in fullerene graphs
• Nice pairs of odd cycles in fullerene graphs
• Packing stars in fullerenes
• Finding more perfect matchings in leapfrog fullerenes
• Fullerene graphs have exponentially many perfect matchings
• A note on the cyclical edge-connectivity of fullerene graphs
• Saturation number of fullerene graphs
• Leapfrog fullerenes have many perfect matchings
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• Forcing matching numbers of fullerene graphs

This page was built for publication: New lower bound on the number of perfect matchings in fullerene graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600673)