Pages that link to "Item:Q406332"
From MaRDI portal
The following pages link to An efficient algorithm to determine all shortest paths in Sierpiński graphs (Q406332):
Displaying 21 items.
- Computational solution of an old tower of Hanoi problem (Q327694) (← links)
- The number of moves of the largest disc in shortest paths on Hanoi graphs (Q490248) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs (Q2067747) (← links)
- The median of Sierpiński graphs (Q2161247) (← links)
- Metric properties of Sierpiński triangle graphs (Q2161263) (← links)
- The Hanoi graph \(H_4^3\) (Q2194534) (← links)
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) (Q2239024) (← links)
- On generalized Sierpiński graphs (Q2364078) (← links)
- Open problems for Hanoi and Sierpiński graphs (Q2413332) (← links)
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs (Q2420418) (← links)
- Packing chromatic number of base-3 Sierpiński graphs (Q2631074) (← links)
- Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
- Recognizing generalized Sierpiński graphs (Q4988984) (← links)
- On the roman domination number of generalized Sierpiński graphs (Q5023115) (← links)
- GEODESICS IN THE SIERPINSKI CARPET AND MENGER SPONGE (Q5085427) (← links)
- (Q5094080) (← links)
- Degree sequence of the generalized Sierpiński graph (Q5149418) (← links)
- On distances in generalized Sierpiński graphs (Q5155698) (← links)
- Connectivity and some other properties of generalized Sierpiński graphs (Q5155718) (← links)
