Pages that link to "Item:Q4806494"
From MaRDI portal
The following pages link to 1-perfect codes in Sierpiński graphs (Q4806494):
Displayed 15 items.
- Global strong defensive alliances of Sierpiński-like graphs (Q372953) (← links)
- Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs (Q444448) (← links)
- On perfect codes in Cartesian products of graphs (Q627927) (← links)
- The hub number of Sierpiński-like graphs (Q649112) (← links)
- Shortest paths in Sierpiński graphs (Q741754) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Perfect codes in direct products of cycles-a complete characterization (Q931836) (← links)
- Characterizing \(r\)-perfect codes in direct products of two and three cycles (Q1041710) (← 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)
- Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)