On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
Sierpi?ski graphs Sn 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 Sn p is introduced as a vertex that is either adjacent to an extreme vertex of Sn p or …