Pages that link to "Item:Q1775033"
From MaRDI portal
The following pages link to Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence (Q1775033):
Displayed 22 items.
- The outer-connected domination number of Sierpiński-like graphs (Q255280) (← 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)
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs (Q444448) (← 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)
- Linking the Calkin-Wilf and Stern-Brocot trees (Q709233) (← 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)
- Hanoi graphs and some classical numbers (Q813952) (← links)
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
- The Wiener index of Sierpiński-like graphs (Q1743486) (← links)
- The average eccentricity of Sierpiński graphs (Q1926020) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
- Stern polynomials (Q2383531) (← links)
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs (Q2408565) (← links)
- A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE (Q3435262) (← links)
- What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? (Q4621297) (← links)