Error-correcting codes on the Towers of Hanoi graphs

DOI10.1016/S0012-365X(99)00070-9zbMath0957.94052OpenAlexW1965182118MaRDI QIDQ1808786

Paul Cull, Ingrid Nelson

Publication date: 29 March 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00070-9

zbMATH Keywords

NP-completeTowers of Hanoicodes on graphsperfect one-error-correcting code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Other types of codes (94B60)

Related Items (19)

Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ 1-perfect codes in Sierpiński graphs ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ An almost complete description of perfect codes in direct products of cycles ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ On perfect codes in Cartesian products of graphs ⋮ Perfect codes in direct products of cycles-a complete characterization ⋮ A survey and classification of Sierpiński-type graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ On the planarity of Hanoi graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Unnamed Item ⋮ The (non-)existence of perfect codes in Fibonacci cubes ⋮ Shortest paths in Sierpiński graphs ⋮ Characterizing \(r\)-perfect codes in direct products of two and three cycles ⋮ SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA

This page was built for publication: Error-correcting codes on the Towers of Hanoi graphs