Generalized Sierpiński graphs 1

@inproceedings{Gravier2011GeneralizedSG,
  title={Generalized Sierpiński graphs 1},
  author={Sylvain Gravier and Matjaz Kovse and Aline Parreau},
  year={2011}
}
Sierpiński graphs, S(n, k), were defined originally in 1997 by Klavžar and Milutinović. The graph S(1, k) is simply the complete graph Kk and S(n, 3) are the graphs of Tower of Hanoi problem. We generalize the notion of Sierpiński graphs, replacing the complete graph appearing in the case S(1, k) with any graph. The newly introduced notion of generalized Sierpiński graphs can be seen as a criteria to define a graph to be self-similar. We describe the automorphism group of those graphs and… CONTINUE READING