Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
From MaRDI portal
Publication:1714113
DOI10.1007/s10910-018-0944-zzbMath1406.92793OpenAlexW2888793902WikidataQ129321784 ScholiaQ129321784MaRDI QIDQ1714113
Publication date: 31 January 2019
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-018-0944-z
Graph polynomials (05C31) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (max. 100)
Matching Forcing Polynomials of Constructable Hexagonal Systems ⋮ Matching anti-forcing polynomials of catacondensed hexagonal systems ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ The minimum forcing number of perfect matchings in the hypercube ⋮ On the forcing matching numbers of prisms of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A maximum resonant set of polyomino graphs
- A minimax result for perfect matchings of a polyomino graph
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
- Anti-forcing spectra of perfect matchings of graphs
- Extremal anti-forcing numbers of perfect matchings of graphs
- A linear algorithm for a perfect matching in polyomino graphs
- Bounds on the forcing numbers of bipartite graphs
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- The minimum forcing number for the torus and hypercube
- Perfect matchings of polyomino graphs
- Forcing matchings on square grids
- Forcing polynomials of benzenoid parallelogram and its related benzenoids
- Anti-forcing polynomials for benzenoid systems with forcing edges
- On the forced matching numbers of bipartite graphs
- The number of Kekulé structures of polyominos on the torus
- Dimer statistics on the Möbius strip and the Klein bottle
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
- On the anti-forcing number of benzenoids
- Dimers and amoebae
- The statistics of dimers on a lattice
- Statistical Mechanics of Dimers on a Plane Lattice
- A Minimax Theorem for Directed Graphs
- Tight upper bound on the maximum anti-forcing numbers of graphs
- On the spectrum of the forced matching number of graphs
- Dimer problem in statistical mechanics-an exact result
- Close-packed dimers on nonorientable surfaces
- Anti-forcing numbers of perfect matchings of graphs
This page was built for publication: Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
