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

Enumeration of subtrees of planar two-tree networks

Author

Listed:
  • Sun, Daoqiang
  • Li, Long
  • Liu, Kai
  • Wang, Hua
  • Yang, Yu

Abstract

The number of subtrees, also referred to as the subtrees index, is a key parameter to measure graph structures such as networks. In this paper, we investigate the number of subtrees of planar two-tree networks. By “adding a virtual edge” and “edge orientation”, we present a linear time algorithm for computing the number of subtrees of planar two-tree networks, as well as a family of planar two-connected networks. As applications, we provide the formulae for the number of subtrees of the famous small-world Farey network and GDURT network. We also discuss the relationship between the spanning subtree number and the subtree number of these networks.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:apmaco:v:434:y:2022:i:c:s0096300322004787
    DOI: 10.1016/j.amc.2022.127404
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322004787
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127404?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. Benjamin Allen & Gabor Lippner & Yu-Ting Chen & Babak Fotouhi & Naghmeh Momeni & Shing-Tung Yau & Martin A. Nowak, 2017. "Evolutionary dynamics on any population structure," Nature, Nature, vol. 544(7649), pages 227-230, April.
    2. Xiao, Yuzhi & Zhao, Haixing & Hu, Guona & Ma, Xiujuan, 2014. "Enumeration of spanning trees in planar unclustered networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 406(C), pages 236-243.
    3. Yang, Yu & Fan, Ai-wan & Wang, Hua & Lv, Hailian & Zhang, Xiao-Dong, 2019. "Multi-distance granularity structural α-subtree index of generalized Bethe trees," Applied Mathematics and Computation, Elsevier, vol. 359(C), pages 107-120.
    4. 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.
    5. Yu, Guihai & Li, Xingfu & He, Deyan, 2022. "Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity," Applied Mathematics and Computation, Elsevier, vol. 416(C).
    6. Xiao, Yuzhi & Zhao, Haixing, 2013. "New method for counting the number of spanning trees in a two-tree network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4576-4583.
    7. 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.
    8. 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.
    9. 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).
    10. Spiro, Sam, 2022. "The Wiener index of signed graphs," Applied Mathematics and Computation, Elsevier, vol. 416(C).
    Full references (including those not matched with items on IDEAS)

    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. 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).
    2. 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).
    3. 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.
    4. M. Kleshnina & K. Kaveh & K. Chatterjee, 2020. "The role of behavioural plasticity in finite vs infinite populations," Papers 2009.13160, arXiv.org.
    5. Li, Wen-Jing & Chen, Zhi & Jin, Ke-Zhong & Li, Lan & Yuan, Lin & Jiang, Luo-Luo & Perc, Matjaž & Kurths, Jürgen, 2022. "Eliminating poverty through social mobility promotes cooperation in social dilemmas," Chaos, Solitons & Fractals, Elsevier, vol. 156(C).
    6. Fulin Guo, 2023. "Experience-weighted attraction learning in network coordination games," Papers 2310.18835, arXiv.org.
    7. McAvoy, Alex & Fraiman, Nicolas & Hauert, Christoph & Wakeley, John & Nowak, Martin A., 2018. "Public goods games in populations with fluctuating size," Theoretical Population Biology, Elsevier, vol. 121(C), pages 72-84.
    8. 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.
    9. Christopher Graser & Takako Fujiwara-Greve & Julian García & Matthijs van Veelen, 2024. "Repeated games with partner choice," Tinbergen Institute Discussion Papers 24-038/I, Tinbergen Institute.
    10. Thomas Graham & Maria Kleshnina & Jerzy A. Filar, 2023. "Where Do Mistakes Lead? A Survey of Games with Incompetent Players," Dynamic Games and Applications, Springer, vol. 13(1), pages 231-264, March.
    11. Shiro Horiuchi, 2021. "Bridging of different sites by bohemians and tourists: analysis by agent-based simulation," Journal of Computational Social Science, Springer, vol. 4(2), pages 567-584, November.
    12. Jiang, Zhi-Qiang & Wang, Peng & Ma, Jun-Chao & Zhu, Peican & Han, Zhen & Podobnik, Boris & Stanley, H. Eugene & Zhou, Wei-Xing & Alfaro-Bittner, Karin & Boccaletti, Stefano, 2023. "Unraveling the effects of network, direct and indirect reciprocity in online societies," Chaos, Solitons & Fractals, Elsevier, vol. 169(C).
    13. Fabio Della Rossa & Fabio Dercole & Anna Di Meglio, 2020. "Direct Reciprocity and Model-Predictive Strategy Update Explain the Network Reciprocity Observed in Socioeconomic Networks," Games, MDPI, vol. 11(1), pages 1-28, March.
    14. Sarkar, Bijan, 2021. "The cooperation–defection evolution on social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    15. Peican Zhu & Xin Hou & Yangming Guo & Jiwei Xu & Jinzhuo Liu, 2021. "Investigating the effects of updating rules on cooperation by incorporating interactive diversity," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 94(2), pages 1-8, February.
    16. Li, Bin-Quan & Wu, Zhi-Xi & Guan, Jian-Yue, 2022. "Critical thresholds of benefit distribution in an extended snowdrift game model," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    17. Sakiyama, Tomoko, 2021. "A power law network in an evolutionary hawk–dove game," Chaos, Solitons & Fractals, Elsevier, vol. 146(C).
    18. Qi Su & Lei Zhou & Long Wang, 2019. "Evolutionary multiplayer games on graphs with edge diversity," PLOS Computational Biology, Public Library of Science, vol. 15(4), pages 1-22, April.
    19. Guo, Songlin & Wang, Wei & Wang, Chuanming, 2023. "Disproof of a conjecture on the minimum Wiener index of signed trees," Applied Mathematics and Computation, Elsevier, vol. 439(C).
    20. Wang, Chaoqian & Szolnoki, Attila, 2023. "Inertia in spatial public goods games under weak selection," Applied Mathematics and Computation, Elsevier, vol. 449(C).

    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:apmaco:v:434:y:2022:i:c:s0096300322004787. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.