On forcing matching number of boron-nitrogen fullerene graphs

DOI10.1016/J.DAM.2011.05.006MaRDI QIDQ642986zbMATH OpenOpenAlexFDO

Authors Heping Zhang, Xiao-yan Jiang

Publication date 27 October 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.05.006

zbMATH Keywords

perfect matchingforcing numberboronnitrogen fullerene

Mathematics Subject Classification ID

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

Recommendations

• Forcing matching numbers of fullerene graphs
• Characterizing the fullerene graphs with the minimum forcing number 3
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• Complete forcing numbers of catacondensed hexagonal systems
• On the forced matching numbers of bipartite graphs

Cites work

• scientific article; zbMATH DE number 2152546 (Why is no real title available?)
• scientific article; zbMATH DE number 867631 (Why is no real title available?)
• scientific article; zbMATH DE number 5238980 (Why is no real title available?)
• Bounds on the forcing numbers of bipartite graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Forcing bonds of a benzenoid system
• Forcing matching numbers of fullerene graphs
• Forcing matchings on square grids
• Forcing numbers of stop signs.
• Global forcing number of benzenoid graphs
• Hexagonal systems with forcing edges
• Hexagonal systems with forcing single edges
• Matching theory
• On the forced matching numbers of bipartite graphs
• On the spectrum of the forced matching number of graphs
• Plane elementary bipartite graphs
• The forcing number of toroidal polyhexes
• The minimum forcing number for the torus and hypercube

Cited in

(19)

• On lower bounds of number of perfect matchings in fullerene graphs
• Extremal anti-forcing numbers of perfect matchings of graphs
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• Continuous forcing spectrum of regular hexagonal polyhexes
• Complete forcing numbers of \((4, 6)\)-fullerenes
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• Forcing matching numbers of fullerene graphs
• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
• scientific article; zbMATH DE number 5005323 (Why is no real title available?)
• Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces
• Fullerenes and disk-fullerenes
• Characterizing the fullerene graphs with the minimum forcing number 3
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• Counting clar structures of \((4,6)\)-fullerenes
• The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
• Uniquely forced perfect matching and unique 3-edge-coloring
• Anti-forcing spectra of perfect matchings of graphs
• On the anti-Kekulé problem of cubic graphs

This page was built for publication: On forcing matching number of boron-nitrogen fullerene graphs

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