Dimer–monomer model on the Towers of Hanoi graphs

DOI10.1142/S0217979215501738zbMath1337.82027arXiv1410.8223MaRDI QIDQ5744136

Hanyuan Deng, Renfang Wu, Han Lin Chen, Guihua Huang

Publication date: 17 February 2016

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

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

zbMATH Keywords

entropyasymptotic enumerationSierpiński graphrecursion relationTower of Hanoi graphdimer-monomer model

Mathematics Subject Classification ID

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

Related Items (5)

Study of dimer-monomer on the generalized Hanoi graph ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ Enumeration of maximum matchings in the Hanoi graphs using matching polynomials ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs

Cites Work

• Unnamed Item

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