The forcing number of toroidal polyhexes
From MaRDI portal
Publication:937596
DOI10.1007/s10910-006-9208-4zbMath1195.92081OpenAlexW2084737762MaRDI QIDQ937596
Publication date: 15 August 2008
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-006-9208-4
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 (11)
The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Hyperbolic analogues of fullerenes on orientable surfaces ⋮ Anti-forcing spectrum of any cata-condensed hexagonal system is continuous ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Forcing matching numbers of fullerene graphs ⋮ The global forcing number of the parallelogram polyhex ⋮ Continuous forcing spectra of even polygonal chains ⋮ Some tight bounds on the minimum and maximum forcing numbers of graphs
Cites Work
- Bounds on the forcing numbers of bipartite graphs
- The minimum forcing number for the torus and hypercube
- 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
- Resonance in elemental benzenoids
- \(k\)-resonance in toroidal polyhexes
- Forcing bonds of a benzenoid system
This page was built for publication: The forcing number of toroidal polyhexes
