Pages that link to "Item:Q5757379"
From MaRDI portal
The following pages link to Shortest Paths in the Tower of Hanoi Graph and Finite Automata (Q5757379):
Displayed 41 items.
- The outer-connected domination number of Sierpiński-like graphs (Q255280) (← links)
- Extrema property of the \(k\)-ranking of directed paths and cycles (Q322050) (← links)
- Sierpiński graphs as spanning subgraphs of Hanoi graphs (Q352716) (← links)
- Global strong defensive alliances of Sierpiński-like graphs (Q372953) (← links)
- An efficient algorithm to determine all shortest paths in Sierpiński graphs (Q406332) (← links)
- Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
- Twin towers of Hanoi (Q444425) (← links)
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs (Q444448) (← links)
- Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes (Q476903) (← links)
- The number of moves of the largest disc in shortest paths on Hanoi graphs (Q490248) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- The hub number of Sierpiński-like graphs (Q649112) (← links)
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles (Q730903) (← links)
- Shortest paths in Sierpiński graphs (Q741754) (← links)
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
- Metric properties of Sierpiński-like graphs (Q1734751) (← links)
- The Wiener index of Sierpiński-like graphs (Q1743486) (← links)
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence (Q1775033) (← links)
- The average eccentricity of Sierpiński graphs (Q1926020) (← links)
- The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
- Mean geodesic distance of the level-\(n\) Sierpinski gasket (Q2062592) (← links)
- Average geodesic distance on stretched Sierpiński gasket (Q2145461) (← links)
- Sharp bounds on certain degree based topological indices for generalized Sierpiński graphs (Q2185166) (← links)
- The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system (Q2207944) (← links)
- The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
- The intrinsic metric on the box fractal (Q2330378) (← links)
- Intrinsic metrics on Sierpinski-like triangles and their geometric properties (Q2333607) (← links)
- Distances in Sierpiński graphs and on the Sierpiński gasket (Q2375905) (← links)
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs (Q2408565) (← links)
- Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
- What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? (Q4621297) (← links)
- An explicit formula of the intrinsic metric on the Sierpinski gasket via code representation (Q4634131) (← links)
- ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK (Q4961151) (← links)
- GEODESICS OF HIGHER-DIMENSIONAL SIERPINSKI GASKET (Q4961169) (← links)
- The formulization of the intrinsic metric on the added Sierpinski triangle by using the code representations (Q4970771) (← links)
- AVERAGE FERMAT DISTANCE OF A FRACTAL TREE (Q5025350) (← links)
- Degree sequence of the generalized Sierpiński graph (Q5149418) (← links)
- Connectivity and some other properties of generalized Sierpiński graphs (Q5155718) (← links)
- (Q5214052) (← links)
- Random walks on dual Sierpinski gaskets (Q6176639) (← links)