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

被引：26
|
作者：
Comellas, Francesc [1 ]
Miralles, Alicia [1 ]
Liu, Hongxiao [2 ]
Zhang, Zhongzhi [2 ]
机构：
[1] Univ Politecn Cataluna, EPSC, Dep Matemat Aplicada 4, E-08028 Barcelona, Catalonia, Spain
[2] Fudan Univ, Sch Comp Sci, Shanghai Key Lab Intelligent Informat Proc, Shanghai 200433, Peoples R China
来源：
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS | 2013年 / 392卷 / 12期
基金：
中国国家自然科学基金;
关键词：
Spanning trees; Tree entropy; Complex networks; Self-similarity; ENUMERATION;
D O I：
10.1016/j.physa.2012.10.047
中图分类号：
O4 [物理学];
学科分类号：
0702 ;
摘要：
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. (c) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：2803 / 2806
页数：4
相关论文
共 29 条
  • [1] The Tutte polynomial of an infinite family of outerplanar; small-world and self-similar graphs
    Liao, Yunhua
    Fang, Aixiang
    Hou, Yaoping
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (19) : 4584 - 4593
  • [2] The Number of Spanning Trees in Self-Similar Graphs
    Teufl, Elmar
    Wagner, Stephan
    ANNALS OF COMBINATORICS, 2011, 15 (02) : 355 - 380
  • [3] The Number of Spanning Trees in Self-Similar Graphs
    Elmar Teufl
    Stephan Wagner
    Annals of Combinatorics, 2011, 15 : 355 - 380
  • [4] Weighted spanning trees on some self-similar graphs
    D'Angeli, Daniele
    Donno, Alfredo
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [5] A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models
    Fei Ma
    Jing Su
    Bing Yao
    The European Physical Journal B, 2018, 91
  • [6] A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models
    Ma, Fei
    Su, Jing
    Yao, Bing
    EUROPEAN PHYSICAL JOURNAL B, 2018, 91 (05):
  • [7] Resistance Scaling and the Number of Spanning Trees in Self-Similar Lattices
    Teufl, Elmar
    Wagner, Stephan
    JOURNAL OF STATISTICAL PHYSICS, 2011, 142 (04) : 879 - 897
  • [8] Resistance Scaling and the Number of Spanning Trees in Self-Similar Lattices
    Elmar Teufl
    Stephan Wagner
    Journal of Statistical Physics, 2011, 142 : 879 - 897
  • [9] The number of spanning trees of a class of self-similar fractal models
    Ma, Fei
    Yao, Bing
    INFORMATION PROCESSING LETTERS, 2018, 136 : 64 - 69
  • [10] Modeling complex networks with self-similar outerplanar unclustered graphs
    Comellas, Francesc
    Miralles, Alicia
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2009, 388 (11) : 2227 - 2233
123