On forcing matching number of boron-nitrogen fullerene graphs
DOI10.1016/J.DAM.2011.05.006zbMATH Open1228.05233OpenAlexW2157425599MaRDI QIDQ642986FDOQ642986
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
Recommendations
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)
Cites Work
- Matching theory
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- The minimum forcing number for the torus and hypercube
- Forcing numbers of stop signs.
- On the forced matching numbers of bipartite graphs
- Hexagonal systems with forcing edges
- Forcing bonds of a benzenoid system
- On the spectrum of the forced matching number of graphs
- Hexagonal systems with forcing single edges
- The forcing number of toroidal polyhexes
- Forcing matching numbers of fullerene graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on the forcing numbers of bipartite graphs
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- Title not available (Why is that?)
- Global forcing number of benzenoid graphs
Cited In (19)
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
- On the anti-Kekulé problem of cubic graphs
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
- Forcing and anti-forcing numbers of (3,6)-fullerenes
- Forcing matching numbers of fullerene graphs
- Continuous forcing spectrum of regular hexagonal polyhexes
- On lower bounds of number of perfect matchings in fullerene graphs
- Complete forcing numbers of \((4, 6)\)-fullerenes
- Characterizing the fullerene graphs with the minimum forcing number 3
- Uniquely forced perfect matching and unique 3-edge-coloring
- Fullerenes and disk-fullerenes
- Counting clar structures of \((4,6)\)-fullerenes
- Anti-forcing spectra of perfect matchings of graphs
- Extremal anti-forcing numbers of perfect matchings of graphs
- The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
- Title not available (Why is that?)
- Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
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)
