Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
From MaRDI portal
Publication:3980916
Recommendations
- Generalized expression of the perfect matching number for 2×3×n lattices
- Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
- Dimer problem for some three dimensional lattice graphs
- Enumeration of perfect matchings of a type of quadratic lattice on the torus
Cites work
- An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices
- Dimer problem in statistical mechanics-an exact result
- Justification of Vdovichenko's method for the Ising model on a two-dimensional lattice.
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(6)- Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
- Two counterparts of the TFK formula for cylinder graphs
- Generalized expression of the perfect matching number for 2×3×n lattices
- The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
- Dimer problem on cylinders: recurrences and generating functions
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
This page was built for publication: Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980916)