On forcing matching number of boron-nitrogen fullerene graphs

DOI10.1016/j.dam.2011.05.006zbMath1228.05233OpenAlexW2157425599MaRDI QIDQ642986

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 matchingboronforcing numbernitrogen 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)

Related Items (14)

The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ Continuous forcing spectrum of regular hexagonal polyhexes ⋮ The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Characterizing the fullerene graphs with the minimum forcing number 3 ⋮ On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Anti-forcing spectrum of any cata-condensed hexagonal system is continuous ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Counting clar structures of \((4,6)\)-fullerenes ⋮ On the anti-Kekulé problem of cubic graphs ⋮ Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces ⋮ Fullerenes and disk-fullerenes

Cites Work

• Hexagonal systems with forcing single edges
• Bounds on the forcing numbers of bipartite graphs
• The forcing number of toroidal polyhexes
• Forcing matching numbers of fullerene graphs
• Matching theory
• The minimum forcing number for the torus and hypercube
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Forcing numbers of stop signs.
• Plane elementary bipartite graphs
• Forcing matchings on square grids
• On the forced matching numbers of bipartite graphs
• Hexagonal systems with forcing edges
• Forcing bonds of a benzenoid system
• Global forcing number of benzenoid graphs
• On the spectrum of the forced matching number of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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