The Number of Spanning Trees in Self-Similar Graphs

被引：0
|
作者：
Elmar Teufl
Stephan Wagner
机构：
[1] Eberhard Karls Universität Tübingen,Fachbereich Mathematik
[2] Stellenbosch University,Department of Mathematical Sciences
来源：
Annals of Combinatorics | 2011年 / 15卷
关键词：
05C30; 05C05; 34B45; spanning trees; self-similar graphs;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The number of spanning trees of a graph, also known as the complexity, is computed for graphs constructed by a replacement procedure yielding a self-similar structure. It is shown that under certain symmetry conditions exact formulas for the complexity can be given. These formulas indicate interesting connections to the theory of electrical networks. Examples include the well-known Sierpiński graphs and their higher-dimensional analogues. Several auxiliary results are provided on the way—for instance, a property of the number of rooted spanning forests is proven for graphs with a high degree of symmetry.
引用
收藏
页码：355 / 380
页数：25
相关论文
共 50 条
  • [1] The Number of Spanning Trees in Self-Similar Graphs
    Teufl, Elmar
    Wagner, Stephan
    ANNALS OF COMBINATORICS, 2011, 15 (02) : 355 - 380
  • [2] Weighted spanning trees on some self-similar graphs
    D'Angeli, Daniele
    Donno, Alfredo
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [3] 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
  • [4] Resistance Scaling and the Number of Spanning Trees in Self-Similar Lattices
    Elmar Teufl
    Stephan Wagner
    Journal of Statistical Physics, 2011, 142 : 879 - 897
  • [5] The number of spanning trees of a class of self-similar fractal models
    Ma, Fei
    Yao, Bing
    INFORMATION PROCESSING LETTERS, 2018, 136 : 64 - 69
  • [6] The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
    Comellas, Francesc
    Miralles, Alicia
    Liu, Hongxiao
    Zhang, Zhongzhi
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (12) : 2803 - 2806
  • [7] Counting spanning trees in self-similar networks by evaluating determinants
    Lin, Yuan
    Wu, Bin
    Zhang, Zhongzhi
    Chen, Guanrong
    JOURNAL OF MATHEMATICAL PHYSICS, 2011, 52 (11)
  • [8] On the Number of Spanning Trees of Graphs
    Bozkurt, S. Burcu
    Bozkurt, Durmus
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [9] Correct proof of the main result in "The number of spanning trees of a class of self-similar fractal models" by Ma and Yao
    El Atik, Abd El Fattah A.
    Aboutahoun, A. W.
    Elsaid, A.
    INFORMATION PROCESSING LETTERS, 2021, 170
  • [10] On graphs with the maximum number of spanning trees
    Kelmans, AK
    RANDOM STRUCTURES & ALGORITHMS, 1996, 9 (1-2) : 177 - 192
12345