Pages that link to "Item:Q4209980"

The following pages link to Graphs S(n, k) and a Variant of the Tower of Hanoi Problem (Q4209980):

Displaying 20 items.

• The outer-connected domination number of Sierpiński-like graphs (Q255280) (← links)
• On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs (Q317939) (← links)
• Computational solution of an old tower of Hanoi problem (Q327694) (← 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)
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs (Q444448) (← links)
• Coloring the square of Sierpiński graphs (Q497382) (← 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)
• The hub number of Sierpiński-like graphs (Q649112) (← links)
• Shortest paths in Sierpiński graphs (Q741754) (← links)
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
• Constructions of universalized Sierpiński graphs based on labeling manipulations (Q1687837) (← links)
• Metric properties of Sierpiński-like graphs (Q1734751) (← links)
• The Wiener index of Sierpiński-like graphs (Q1743486) (← links)
• Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence (Q1775033) (← links)
• On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs (Q2420418) (← links)