The forcing number of toroidal polyhexes

DOI10.1007/S10910-006-9208-4MaRDI QIDQ937596zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

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

zbMATH Keywords

forcing numberKekulé structuresperfect matchingtoroidal polyhex

Mathematics Subject Classification ID

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

Recommendations

• Maximum forcing number of hexagonal systems
• The minimum forcing number for the torus and hypercube
• scientific article; zbMATH DE number 6749543
• Forcing and anti-forcing polynomials of a type of polyomino graphs
• Complete forcing numbers of hexagonal systems

Cites work

• \(k\)-resonance in toroidal polyhexes
• Bounds on the forcing numbers of bipartite graphs
• Forcing bonds of a benzenoid system
• Forcing matchings on square grids
• Forcing numbers of stop signs.
• Hexagonal systems with forcing edges
• On the forced matching numbers of bipartite graphs
• Plane elementary bipartite graphs
• Resonance in elemental benzenoids
• The minimum forcing number for the torus and hypercube

Cited in

(17)

• The minimum forcing number for the torus and hypercube
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• Continuous forcing spectra of even polygonal chains
• Some tight bounds on the minimum and maximum forcing numbers of graphs
• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
• Hyperbolic analogues of fullerenes on orientable surfaces
• The maximum forcing number of a polyomino
• scientific article; zbMATH DE number 2152546 (Why is no real title available?)
• Anti-forcing spectra of perfect matchings of graphs
• Extremal anti-forcing numbers of perfect matchings of graphs
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• Fractional forcing number of graphs
• Computing the forcing spectrum of outerplanar graphs in polynomial time
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• The global forcing number of the parallelogram polyhex
• Forcing matching numbers of fullerene graphs

This page was built for publication: The forcing number of toroidal polyhexes

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