Monomer–dimer problem on some networks

Ruijuan Wu and Weigen Yan

Physica A: Statistical Mechanics and its Applications, 2016, vol. 457, issue C, 465-468

Abstract: Zhang et al. (2012) obtained the exact formula for the number of all possible monomer–dimer arrangements and the asymptotic growth constant on a scale-free small-world network. In this note, we generalize this result and obtain the exact solution on the monomer–dimer model on many networks. Particularly, we prove that these networks have the same asymptotic growth constant of the number of monomer–dimer arrangements.

Keywords: Monomer–dimer model; Enumeration problem (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437116300632
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:457:y:2016:i:c:p:465-468

DOI: 10.1016/j.physa.2016.03.065

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().