On the monomer-dimer problem of some graphs
From MaRDI portal
Recommendations
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- Using edge generating function to solve monomer-dimer problem
- Monomer-dimer problem on random planar honeycomb lattice
- A Pfaffian formula for monomer-dimer partition functions
- Monomer-dimer problem on some networks
Cites work
- Antiferromagnetism. The Triangular Ising Net
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Dimer problem in statistical mechanics-an exact result
- Enumeration of perfect matchings of a type of Cartesian products of graphs
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- On the number of matchings of graphs formed by a graph operation
- Statistical Mechanics of Dimers on a Plane Lattice
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Theory of monomer-dimer systems
Cited in
(14)- Dimer problem for some three dimensional lattice graphs
- Monomer-dimer problem on some networks
- A positivity property of the dimer entropy of graphs
- The monomer-dimer problem and moment Lyapunov exponents of homogeneous Gaussian random fields
- Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- Using edge generating function to solve monomer-dimer problem
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results
- scientific article; zbMATH DE number 1405905 (Why is no real title available?)
- An asymptotic expansion and recursive inequalities for the monomer-dimer problem
- Monomer-dimer problem on random planar honeycomb lattice
- On the dimer problem of the vertex-edge graph of a cubic graph
- The monopole-dimer model for Cartesian products of graphs: extended abstract
This page was built for publication: On the monomer-dimer problem of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560181)