An expression for the perfect matching number of cubic 2 m n lattices and their asymptotic values
DOI10.1007/BF01169209zbMATH Open0898.92032OpenAlexW4230521685MaRDI QIDQ679048FDOQ679048
Authors: Hideyuki Narumi, Hideaki Kita, Haruo Hosoya 
Publication date: 5 November 1998
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01169209
Recommendations
- Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values
- Generalized expression of the perfect matching number for 2×3×n lattices
- Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
- Enumeration of perfect matchings of a type of quadratic lattice on the torus
- Dimer problem for some three dimensional lattice graphs
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Applications of statistical mechanics to specific types of physical systems (82D99)
Cites Work
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Statistical Mechanics of Dimers on a Plane Lattice
- Dimer problem in statistical mechanics-an exact result
- Title not available (Why is that?)
- 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
- Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
- Generalized expression of the perfect matching number for 2×3×n lattices
Cited In (3)
This page was built for publication: An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679048)
