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

The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs

Author

Listed:
  • Comellas, Francesc
  • Miralles, Alícia
  • Liu, Hongxiao
  • Zhang, Zhongzhi

Abstract

In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its reliability, synchronization capability and diffusion properties. The calculation of the number of spanning trees is a demanding and difficult task, in particular for large graphs, and thus there is much interest in obtaining closed expressions for relevant infinite graph families. We have also calculated the spanning tree entropy of the graphs which we have compared with those for graphs with the same average degree.

Suggested Citation

  • Comellas, Francesc & Miralles, Alícia & Liu, Hongxiao & Zhang, Zhongzhi, 2013. "The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(12), pages 2803-2806.
    • Handle: RePEc:eee:phsmap:v:392:y:2013:i:12:p:2803-2806
    DOI: 10.1016/j.physa.2012.10.047
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437113001775
    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.2012.10.047?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. 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.
    2. Ramon Ferrer i Cancho & Christiaan Janssen & Ricard V. Solé, 2001. "The Topology of Technology Graphs: Small World Patterns in Electronic Circuits," Working Papers 01-05-029, Santa Fe Institute.
    3. Yuhai Tu, 2000. "How robust is the Internet?," Nature, Nature, vol. 406(6794), pages 353-354, July.
    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. Alfaro, Carlos A. & Villagrán, Ralihe R., 2021. "The structure of sandpile groups of outerplanar graphs," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    2. Sun, Bingbin & Yao, Jialing & Xi, Lifeng, 2019. "Eigentime identities of fractal sailboat networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 338-349.
    3. 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).
    4. Liao, Yunhua & Fang, Aixiang & Hou, Yaoping, 2013. "The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4584-4593.

    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. Miralles, Alicia & Comellas, Francesc & Chen, Lichao & Zhang, Zhongzhi, 2010. "Planar unclustered scale-free graphs as models for technological and biological networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(9), pages 1955-1964.
    2. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    3. Shang, Yilun, 2021. "Generalized k-cores of networks under attack with limited knowledge," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    4. Selen Onel & Abe Zeid & Sagar Kamarthi, 2011. "The structure and analysis of nanotechnology co-author and citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 89(1), pages 119-138, October.
    5. Huang, Chung-Yuan & Chin, Wei-Chien-Benny & Fu, Yu-Hsiang & Tsai, Yu-Shiuan, 2019. "Beyond bond links in complex networks:Local bridges, global bridges and silk links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    6. Ali Kharrazi & Brian D. Fath & Harald Katzmair, 2016. "Advancing Empirical Approaches to the Concept of Resilience: A Critical Examination of Panarchy, Ecological Information, and Statistical Evidence," Sustainability, MDPI, vol. 8(9), pages 1-17, September.
    7. Nie, Tingyuan & Fan, Bo & Wang, Zhenhao, 2022. "Complexity and robustness of weighted circuit network of placement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    8. Cárdenas, J.P. & Mouronte, M.L. & Benito, R.M. & Losada, J.C., 2010. "Compatibility as underlying mechanism behind the evolution of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(8), pages 1789-1798.
    9. Yinhu Zhai & Jia-Bao Liu & Shaohui Wang, 2017. "Structure Properties of Koch Networks Based on Networks Dynamical Systems," Complexity, Hindawi, vol. 2017, pages 1-7, March.
    10. Raúl M. Falcón & Nagaraj Mohanapriya & Venkitachalam Aparna, 2022. "Optimal Shadow Allocations of Secret Sharing Schemes Arisen from the Dynamic Coloring of Extended Neighborhood Coronas," Mathematics, MDPI, vol. 10(12), pages 1-14, June.
    11. Coninck, José C.P. & Ferrari, Fabiano A.S. & Reis, Adriane S. & Iarosz, Kelly C. & Caldas, Iberê L. & Batista, Antonio M. & Viana, Ricardo L., 2020. "Network properties of healthy and Alzheimer brains," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 547(C).
    12. Cárdenas, J.P. & Mouronte, M.L. & Moyano, L.G. & Vargas, M.L. & Benito, R.M., 2010. "On the robustness of Spanish telecommunication networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(19), pages 4209-4216.
    13. Lin Zhang & Jian Lu & Bai-bai Fu & Shu-bin Li, 2018. "A Review and Prospect for the Complexity and Resilience of Urban Public Transit Network Based on Complex Network Theory," Complexity, Hindawi, vol. 2018, pages 1-36, December.
    14. Jin, Yi & Zhang, Qingyuan & Chen, Yunxia & Lu, Zhendan & Zu, Tianpei, 2023. "Cascading failures modeling of electronic circuits with degradation using impedance network," Reliability Engineering and System Safety, Elsevier, vol. 233(C).
    15. Dan Braha & Yaneer Bar-Yam, 2007. "The Statistical Mechanics of Complex Product Development: Empirical and Analytical Results," Management Science, INFORMS, vol. 53(7), pages 1127-1145, July.
    16. Didier Wernli & Lucas Böttcher & Flore Vanackere & Yuliya Kaspiarovich & Maria Masood & Nicolas Levrat, 2023. "Understanding and governing global systemic crises in the 21st century: A complexity perspective," Global Policy, London School of Economics and Political Science, vol. 14(2), pages 207-228, May.
    17. Kibae Kim & Jörn Altmann, 2015. "Effect of Homophily on Network Formation," TEMEP Discussion Papers 2015121, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Mar 2017.
    18. Kibae Kim & Jorn Altmann, 2013. "Evolution of the Software-as-a-Service Innovation System Through Collective Intelligence," TEMEP Discussion Papers 2013108, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Dec 2013.
    19. Junseok Hwang & Jorn Altmann & Kibae Kim, 2009. "The Structural Evolution of the Web2.0 Service Network," TEMEP Discussion Papers 200914, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Sep 2009.
    20. Lucas Cuadra & Sancho Salcedo-Sanz & Javier Del Ser & Silvia Jiménez-Fernández & Zong Woo Geem, 2015. "A Critical Review of Robustness in Power Grids Using Complex Networks Concepts," Energies, MDPI, vol. 8(9), pages 1-55, August.

    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:392:y:2013:i:12:p:2803-2806. 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.