{"paper":{"title":"Dimer-monomer Model on the Towers of Hanoi Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MP"],"primary_cat":"math-ph","authors_text":"Guihua Huang, Hanlin Chen, Hanyuan Deng, Renfang Wu","submitted_at":"2014-10-30T01:11:20Z","abstract_excerpt":"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 $\\mu_{G}=\\lim_{v(G)\\rightarrow\\infty}\\frac{\\ln m(G)}{v(G)}$, where $v(G)$ is the number of vertices in a graph $G$, on these Sierp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8223","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}