Dimer coverings on the Tower of Hanoi graph

DOI10.1142/S0217979219500437zbMath1425.82005OpenAlexW2919983027WikidataQ128303146 ScholiaQ128303146MaRDI QIDQ4972871

Wei-Bang Li, Shu-Chiuan Chang

Publication date: 27 November 2019

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

Full work available at URL: https://doi.org/10.1142/s0217979219500437

zbMATH Keywords

dimerrecursion relationtower of Hanoi graphentropy per vertex

Mathematics Subject Classification ID

Applications of graph theory (05C90) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting dimer coverings on self-similar Schreier graphs
• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• Dimer coverings on the Sierpinski gasket
• Dimers on a simple-quartic net with a vacancy
• Relationship among Exactly Soluble Models of Critical Phenomena. I
• The statistics of dimers on a lattice
• Statistical Mechanics of Dimers on a Plane Lattice
• DIMERS ON TWO-DIMENSIONAL LATTICES
• Algebraic Graph Theory
• Dimer problem in statistical mechanics-an exact result

This page was built for publication: Dimer coverings on the Tower of Hanoi graph