On distances in Sierpiński graphs : almost-extreme vertices and metric dimension

@inproceedings{Klavzar2012OnDI,
  title={On distances in Sierpiński graphs : almost-extreme vertices and metric dimension},
  author={Sandi Klavzar},
  year={2012}
}
Sierpiński graphs S p form an extensively studied family of graphs of fractal nature applicable in topology, mathematics of the Tower of Hanoi, computer science, and elsewhere. An almost-extreme vertex of S p is introduced as a vertex that is either adjacent to an extreme vertex of S p or is incident to an edge between two subgraphs of S p isomorphic to S n−1 p . Explicit formulas are given for the distance in S p between an arbitrary vertex and an almost-extreme vertex. The formulas are… CONTINUE READING