Perfect codes on the towers of Hanoi graph

DOI10.1017/S0004972700031774zbMath0917.94017MaRDI QIDQ4209913

Ingrid Nelson, Chi-Kwong Li

Publication date: 28 September 1998

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

perfect codesTowers of Hanoi puzzle1-error correcting codeperfect \(k\)-error correcting codes

Mathematics Subject Classification ID

Distance in graphs (05C12) Combinatorial codes (94B25)

Related Items (8)

Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ Total perfect codes in Cayley graphs ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ Perfect codes in power graphs of finite groups ⋮ A survey and classification of Sierpiński-type graphs ⋮ Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ Subgroup perfect codes in Cayley sum graphs

Cites Work

• Unnamed Item

This page was built for publication: Perfect codes on the towers of Hanoi graph