The Number of Spanning Trees in Self-Similar Graphs

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.

[1]  Stephan G. Wagner,et al.  Enumeration problems for classes of self-similar graphs , 2007, J. Comb. Theory, Ser. A.

[2]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[3]  Frank Harary,et al.  Graphical enumeration , 1973 .

[4]  P. Cameron.  Permutation groups , 1996 .

[5]  Brendan D. McKay,et al.  Spanning Trees in Regular Graphs , 1983, Eur. J. Comb..

[6]  Elmar Teufl,et al.  Spanning trees of finite Sierpiński graphs , 2006 .

[7]  A. Teplyaev,et al.  Self-Similarity, Operators and Dynamics , 2003 .

[8]  Random walks on infinite self-similar graphs , 2007 .

[9]  Elmar Teufl,et al.  The number of spanning trees of finite Sierpi´ nski graphs , 2006 .

[10]  T. Austin,et al.  The Enumeration of Point Labelled Chromatic Graphs and Trees , 1960, Canadian Journal of Mathematics.

[11]  J. Dixon,et al.  Permutation Groups , 1996 .

[12]  Jun Kigami,et al.  Weyl's problem for the spectral distribution of Laplacians on P.C.F. self-similar fractals , 1993 .

[13]  V. Metz,et al.  The short-cut test , 2005 .

[14]  J. Neunhäuserer.  Random walks on infinite self-similar graphs , 2007 .

[15]  Helmut Prodinger,et al.  Spanning tree formulas and chebyshev polynomials , 1986, Graphs Comb..

[16]  S. Chaiken.  A Combinatorial Proof of the All Minors Matrix Tree Theorem , 1982 .

[17]  M. Talagrand,et al.  Lectures on Probability Theory and Statistics , 2000 .

[18]  Charles L. Suffel,et al.  On the characterization of graphs with maximum number of spanning trees , 1998, Discret. Math..

[19]  B. Krön.  Growth of Self-Similar Graphs , 2004, J. Graph Theory.

[20]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[21]  Joseph G. Conlon.  Even cycles in graphs , 2004 .

[22]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[23]  Russell Lyons.  Asymptotic Enumeration of Spanning Trees , 2005, Comb. Probab. Comput..

[24]  Tadashi Shima,et al.  On a spectral analysis for the Sierpinski gasket , 1992 .

[25]  Noga Alon.  The Number of Spanning Trees in Regular Graphs , 1990, Random Struct. Algorithms.

[26]  Omer,et al.  A Bijection for Spanning Trees of Complete Multipartite Graphs , 2007 .

[28]  Martin T. Barlow,et al.  Diffusions on fractals , 1998 .

[29]  Wei-Shih Yang,et al.  Spanning Trees on the Sierpinski Gasket , 2006, cond-mat/0609453.

[30]  S. D. Bedrosian.  Generating formulas for the number of trees in a graph , 1964 .

[31]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[32]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[33]  T. Shima.  On eigenvalue problems for Laplacians on P.C.F. self-similar sets , 1996 .

[34]  A. Cayley.  A theorem on trees , 2009 .

[35]  Arnd Roth,et al.  Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes , 1997, Discret. Appl. Math..

[36]  M. Lapidus,et al.  A trace on fractal graphs and the Ihara zeta function , 2006, math/0608060.

[37]  Igor Pak,et al.  Enumeration of spanning trees of certain graphs , 1990 .

[38]  Christophe Sabot.  Spectral properties of self-similar lattices and iteration of rational maps , 2002 .

[39]  David Bruce Wilson,et al.  Trees and Matchings , 2000, Electron. J. Comb..

[40]  Tadashi Shima.  On eigenvalue problems for the random walks on the Sierpinski pre-gaskets , 1991 .

[41]  F. Y. Wu,et al.  Spanning trees on graphs and lattices in d dimensions , 2000, cond-mat/0004341.

[42]  A. Teplyaev.  Spectral Analysis on Infinite Sierpiński Gaskets , 1998 .

[43]  John W. Moon,et al.  Some determinant expansions and the matrix-tree theorem , 1994, Discret. Math..

[44]  Shing-Tung Yau,et al.  Coverings, Heat Kernels and Spanning Trees , 1998, Electron. J. Comb..

[45]  D. A. Waller.  General solution to the spanning tree enumeration problem in arbitrary multigraph joins , 1976 .

[46]  G. Jones.  PERMUTATION GROUPS (London Mathematical Society Student Texts 45) , 2000 .

[47]  Bernhard Krön,et al.  Green functions on self-similar graphs and bounds for the spectrum of the laplacian , 2002 .

[48]  Richard P. Lewis.  The number of spanning trees of a complete multipartite graph , 1999, Discret. Math..

[49]  D. Gorenstein.  Finite Simple Groups: An Introduction to Their Classification , 1982 .

[50]  J. Kigami,et al.  Analysis on Fractals , 2001 .