Counting spanning trees of a type of generalized Farey graphs
Counting spanning trees of a type of generalized Farey graphs
复制标题
计算一类广义 Farey 图的生成树
DOI：
10.1016/j.physa.2020.124749
复制
发表时间：
2020-10-01
影响因子：
3.3
通讯作者：
Yan，Weigen
中科院分区：
文献类型：
--
作者：
Zhang，Jingyuan;Yan，Weigen
Farey图Fn是由著名的Farey序列导出的，它是一个连通度分布指数衰减的小世界网络.利用矩阵树定理，张等。（2012）给出了Fn的生成树个数的精确公式。本文利用电网络方法研究了一类广义Farey图，给出了这类图的生成树个数的精确解，推广了前人关于Farey图的一些结果.
The Farey graph F n is derived from the famous Farey sequence and it is a small-world network with a connectivity distribution decaying exponentially. By using the Matrix-Tree theorem, Zhang et al.(2012) obtained the exact formula of the number of spanning trees of F n. In this paper, by using the electrical network method, we consider a type of generalized Farey graphs and give the exact solution for the number of spanning trees of these generalized Farey graphs, which generalizes some previous results about the Farey graphs.