Shortest Paths in the Tower of Hanoi Graph and Finite Automata
From MaRDI portal
Publication:5757379
DOI10.1137/050628660zbMath1127.68069arXivmath/0310109OpenAlexW2027013240WikidataQ55885681 ScholiaQ55885681MaRDI QIDQ5757379
Publication date: 6 September 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0310109
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Fractals (28A80) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Packing chromatic number of base-3 Sierpiński graphs, Distances in Sierpiński graphs and on the Sierpiński gasket, Average geodesic distance on stretched Sierpiński gasket, Extrema property of the \(k\)-ranking of directed paths and cycles, Unnamed Item, Sierpiński graphs as spanning subgraphs of Hanoi graphs, Global strong defensive alliances of Sierpiński-like graphs, The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs, The average eccentricity of Sierpiński graphs, Sharp bounds on certain degree based topological indices for generalized Sierpiński graphs, An efficient algorithm to determine all shortest paths in Sierpiński graphs, Coloring Hanoi and Sierpiński graphs, Random walks on dual Sierpinski gaskets, The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system, Twin towers of Hanoi, The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs, The hub number of Sierpiński-like graphs, What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?, Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes, An explicit formula of the intrinsic metric on the Sierpinski gasket via code representation, Metric properties of Sierpiński-like graphs, The number of moves of the largest disc in shortest paths on Hanoi graphs, Coloring the square of Sierpiński graphs, The Wiener index of Sierpiński-like graphs, Connectivity and some other properties of generalized Sierpiński graphs, A survey and classification of Sierpiński-type graphs, The linear \(t\)-colorings of Sierpiński-like graphs, Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence, The \((d, 1)\)-total labelling of Sierpiński-like graphs, A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles, ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK, GEODESICS OF HIGHER-DIMENSIONAL SIERPINSKI GASKET, Shortest paths in Sierpiński graphs, Degree sequence of the generalized Sierpiński graph, The formulization of the intrinsic metric on the added Sierpinski triangle by using the code representations, Vertex-, edge-, and total-colorings of Sierpiński-like graphs, Mean geodesic distance of the level-\(n\) Sierpinski gasket, The intrinsic metric on the box fractal, Intrinsic metrics on Sierpinski-like triangles and their geometric properties, AVERAGE FERMAT DISTANCE OF A FRACTAL TREE, The outer-connected domination number of Sierpiński-like graphs
