Dimer–monomer model on the Towers of Hanoi graphs

DOI10.1142/S0217979215501738zbMATH Open1337.82027arXiv1410.8223MaRDI QIDQ5744136FDOQ5744136

Authors: Hanlin Chen, Renfang Wu, Guihua Huang, Hanyuan Deng 

Publication date: 17 February 2016

Published in: International Journal of Modern Physics B (Search for Journal in Brave)

Abstract: The number of dimer-monomers (matchings) of a graph $G$ is an important graph parameter in statistical physics. Following recent research, we study the asymptotic behavior of the number of dimer-monomers $m(G)$ on the Towers of Hanoi graphs and another variation of the Sierpi'{n}ski graphs which is similar to the Towers of Hanoi graphs, and derive the recursion relations for the numbers of dimer-monomers. Upper and lower bounds for the entropy per site, defined as $m{u}_G=li{m}_{v(G)ightarrowinfty}fraclnm(G)v(G)$, where $v(G)$ is the number of vertices in a graph $G$, on these Sierpi'{n}ski graphs are derived in terms of the numbers at a certain stage. As the difference between these bounds converges quickly to zero as the calculated stage increases, the numerical value of the entropy can be evaluated with more than a hundred significant figures accuracy.

Full work available at URL: https://arxiv.org/abs/1410.8223

Recommendations

• Study of dimer-monomer on the generalized Hanoi graph
• Disordered monomer-dimer model on cylinder graphs
• Monomer-dimer problem on some networks
• Dimer coverings on the Tower of Hanoi graph
• Monomer-dimer problem on random planar honeycomb lattice
• Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results
• Combinatorics of the double-dimer model
• Combinatorics of the double-dimer model
• On dimer models and coamoebas
• The geometry of dimer models

zbMATH Keywords

entropyasymptotic enumerationrecursion relationTower of Hanoi graphdimer-monomer modelSierpiński graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Statistical mechanics of polymers (82D60)

Cites Work

• Title not available (Why is that?)

Cited In (9)

• A survey and classification of Sierpiński-type graphs
• The ice model on the three-dimensional Hanoi graph
• Enumeration of maximum matchings in the Hanoi graphs using matching polynomials
• Dimer coverings on the Sierpinski gasket
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
• Combinatorics of the double-dimer model
• Study of dimer-monomer on the generalized Hanoi graph
• The monopole-dimer model for Cartesian products of graphs: extended abstract
• Connectivity and some other properties of generalized Sierpiński graphs

This page was built for publication: Dimer–monomer model on the Towers of Hanoi graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5744136)