The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
From MaRDI portal
Publication:283197
DOI10.1007/s10910-015-0541-3zbMath1349.05073OpenAlexW1199043230MaRDI QIDQ283197
Publication date: 13 May 2016
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-015-0541-3
Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Continuous forcing spectrum of regular hexagonal polyhexes ⋮ 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 ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Some tight bounds on the minimum and maximum forcing numbers of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On forcing matching number of boron-nitrogen fullerene graphs
- Hexagonal systems with forcing single edges
- The forcing number of toroidal polyhexes
- Forcing matching numbers of fullerene graphs
- The minimum forcing number for the torus and hypercube
- Forcing numbers of stop signs.
- Forcing matchings on square grids
- On the forced matching numbers of bipartite graphs
- Hexagonal systems with forcing edges
- Forced orientation of graphs
- Forcing bonds of a benzenoid system
- The forcing geodetic number of a graph
- On the spectrum of the forced matching number of graphs
This page was built for publication: The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
