An efficient algorithm to determine all shortest paths in Sierpiński graphs

DOI10.1016/j.dam.2014.05.049zbMath1300.05147OpenAlexW2043901149MaRDI QIDQ406332

Caroline Holz auf der Heide, Andreas M. Hinz

Publication date: 8 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.049

zbMATH Keywords

automataSierpiński graphsshortest path algorithmswitching tower of Hanoi

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items

On generalized Sierpiński graphs, Packing chromatic number of base-3 Sierpiński graphs, Computational solution of an old tower of Hanoi problem, The median of Sierpiński graphs, Metric properties of Sierpiński triangle graphs, GEODESICS IN THE SIERPINSKI CARPET AND MENGER SPONGE, Open problems for Hanoi and Sierpiński graphs, On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs, The Hanoi graph \(H_4^3\), The number of moves of the largest disc in shortest paths on Hanoi graphs, Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\), On distances in generalized Sierpiński graphs, Connectivity and some other properties of generalized Sierpiński graphs, A survey and classification of Sierpiński-type graphs, Graphs that are simultaneously efficient open domination and efficient closed domination graphs, Unnamed Item, Degree sequence of the generalized Sierpiński graph, On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs, Recognizing generalized Sierpiński graphs, Feedback vertex number of Sierpiński-type graphs, On the roman domination number of generalized Sierpiński graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The number of moves of the largest disc in shortest paths on Hanoi graphs
• Hamming dimension of a graph-the case of Sierpiński graphs
• Shortest paths in Sierpiński graphs
• Shortest paths between regular states of the Tower of Hanoi
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The tower of Hanoi
• The average eccentricity of Sierpiński graphs
• Distances in Sierpiński graphs and on the Sierpiński gasket
• The Tower of Hanoi – Myths and Maths
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata