IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v555y2020ics0378437120303745.html
   My bibliography  Save this article

Counting spanning trees of a type of generalized Farey graphs

Author

Listed:
  • Zhang, Jingyuan
  • Yan, Weigen

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.

Suggested Citation

  • Zhang, Jingyuan & Yan, Weigen, 2020. "Counting spanning trees of a type of generalized Farey graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).
    • Handle: RePEc:eee:phsmap:v:555:y:2020:i:c:s0378437120303745
    DOI: 10.1016/j.physa.2020.124749
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437120303745
    Download Restriction: 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
    File URL: https://libkey.io/10.1016/j.physa.2020.124749?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zhang, Zhongzhi & Wu, Bin & Lin, Yuan, 2012. "Counting spanning trees in a small-world Farey graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(11), pages 3342-3349.
    2. Jia-Bao Liu & S. N. Daoud, 2019. "Number of Spanning Trees in the Sequence of Some Graphs," Complexity, Hindawi, vol. 2019, pages 1-22, March.
    3. Zhang, Zhongzhi & Rong, Lili & Guo, Chonghui, 2006. "A deterministic small-world network created by edge iterations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 363(2), pages 567-572.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sun, Daoqiang & Li, Long & Liu, Kai & Wang, Hua & Yang, Yu, 2022. "Enumeration of subtrees of planar two-tree networks," Applied Mathematics and Computation, Elsevier, vol. 434(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sun, Daoqiang & Li, Long & Liu, Kai & Wang, Hua & Yang, Yu, 2022. "Enumeration of subtrees of planar two-tree networks," Applied Mathematics and Computation, Elsevier, vol. 434(C).
    2. Lu, Zhe-Ming & Guo, Shi-Ze, 2012. "A small-world network derived from the deterministic uniform recursive tree," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 87-92.
    3. Comellas, Francesc & Miralles, Alicia, 2009. "Modeling complex networks with self-similar outerplanar unclustered graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(11), pages 2227-2233.
    4. Knor, Martin & Škrekovski, Riste, 2013. "Deterministic self-similar models of complex networks based on very symmetric graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4629-4637.
    5. Feng, Qunqiang & Li, Xing & Hu, Zhishui, 2023. "Asymptotic degree distribution in a homogeneous evolving network model," Statistics & Probability Letters, Elsevier, vol. 193(C).
    6. Liang, Jing & Zhao, Haixing & Yin, Jun & Xie, Sun, 2022. "Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    7. De Bona, Anderson Andrei & de Oliveira Rosa, Marcelo & Ono Fonseca, Keiko Verônica & Lüders, Ricardo, 2021. "A reduced model for complex network analysis of public transportation systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 567(C).
    8. Lu, Zhe-Ming & Su, Yu-Xin & Guo, Shi-Ze, 2013. "Deterministic scale-free small-world networks of arbitrary order," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(17), pages 3555-3562.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:555:y:2020:i:c:s0378437120303745. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.