Enumeration problems for classes of self-similar graphs

We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of recurrences and provide methods to solve these recurrences asymptotically. This is shown for different examples involving classical self-similar graphs such as the Sierpinski graphs. The enumeration problems we investigate include counting independent subsets, matchings and connected subsets.

[1]  L. Saloff‐Coste.  RANDOM WALKS ON INFINITE GRAPHS AND GROUPS (Cambridge Tracts in Mathematics 138) , 2001 .

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

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

[4]  N. Sloane,et al.  Some doubly exponential sequences , 1973 .

[5]  R. Rammal,et al.  Random walk statistics on fractal structures , 1984 .

[6]  Leonard Lewin,et al.  Polylogarithms and Associated Functions , 1981 .

[7]  Martin Klazar,et al.  Twelve Countings with Rooted Plane Trees , 1997, Eur. J. Comb..

[8]  Elmar Teufl,et al.  Asymptotics of the transition probabilities of the simple random walk on self-similar graphs , 2002 .

[9]  R. Merrifield,et al.  Topological methods in chemistry , 1989 .

[10]  S. Alexander,et al.  Density of states on fractals : « fractons » , 1982 .

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

[12]  Wolfgang Woess,et al.  Random Walks on Trees with Finitely Many Cone Types , 2002 .

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

[14]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[15]  A. Teplyaev,et al.  Pure Point Spectrum of the Laplacians on Fractal Graphs , 1995 .

[16]  Frank Ruskey.  Listing and Counting Subtrees of a Tree , 1981, SIAM J. Comput..

[17]  N. Trinajstic.  Chemical Graph Theory , 1992 .

[18]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

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

[20]  A. Baram,et al.  Hard square lattice gas , 1994 .

[21]  Laurent Bartholdi,et al.  On the Spectrum of Hecke Type Operators related to some Fractal Groups , 1999 .

[22]  D H Rouvray.  The Role of Graph-Theoretical Invariants in Chemistry. , 1987 .

[23]  John W. Moon,et al.  On maximal independent sets of nodes in trees , 1988, J. Graph Theory.

[24]  Brendan D. McKay,et al.  The number of matchings in random regular graphs and bipartite graphs , 1986, J. Comb. Theory, Ser. B.

[25]  H. Hosoya.  Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons , 1971 .

[26]  László A. Székely,et al.  On subtrees of trees , 2005, Adv. Appl. Math..

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

[28]  Helmut Prodinger,et al.  FIBONACCI NUMBERS OF GRAPHS: II , 1983 .

[29]  G. Toulouse,et al.  Random walks on fractal structures and percolation clusters , 1983 .

[30]  Helmut Prodinger,et al.  Fibonacci Numbers of Graphs III: Planted Plane Trees , 1986 .

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

[32]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[33]  E. J. Farrell.  Counting Matchings in Graphs , 1987 .

[34]  P. Stanica,et al.  EFFECTIVE ASYMPTOTICS FOR SOME NONLINEAR RECURRENCES AND ALMOST DOUBLY-EXPONENTIAL SEQUENCES , 2004 .

[35]  Herbert S. Wilf,et al.  The Number of Independent Sets in a Grid Graph , 1998, SIAM J. Discret. Math..

[36]  W. Woess.  Random walks on infinite graphs and groups, by Wolfgang Woess, Cambridge Tracts , 2001 .