Monomer-dimer problem on some networks

DOI10.1016/J.PHYSA.2016.03.065zbMath1400.82105OpenAlexW2318198961MaRDI QIDQ1619615

Weigen Yan, Ruijuan Wu

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2016.03.065

zbMATH Keywords

enumeration problemmonomer-dimer model

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (2)

Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices ⋮ Using edge generating function to solve monomer-dimer problem

Cites Work

• Unnamed Item
• On the number of matchings of graphs formed by a graph operation
• Theory of monomer-dimer systems
• On the Monomer–Dimer Problem of Some Graphs

This page was built for publication: Monomer-dimer problem on some networks