Counting spanning trees of a type of generalized Farey graphs

Jingyuan Zhang and Weigen Yan

Physica A: Statistical Mechanics and its Applications, 2020, vol. 555, issue C

Abstract: The Farey graph Fn 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 Fn. 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.

Keywords: Spanning tree; Farey graph; Generalized Farey graph; Farey sequence (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437120303745
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:555:y:2020:i:c:s0378437120303745

DOI: 10.1016/j.physa.2020.124749

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 ().