Monomer–dimer problem on some networks
Monomer–dimer problem on some networks
复制标题
DOI：
10.1016/j.physa.2016.03.065
复制
发表时间：
2016-09
影响因子：
3.3
通讯作者：
Rui-Jie Wu;Weigen Yan
中科院分区：
文献类型：
--
作者：
Rui-Jie Wu;Weigen Yan
Zhang等人（2012）得到了无标度小世界网络上所有可能的单体-二聚体排列数和渐近增长常数的精确公式。本文推广了这一结果，得到了许多网络上单-二聚体模型的精确解。特别地，我们证明了这些网络具有相同的渐近增长常数的数目的单体-二聚体安排。
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.