Error-correcting codes on the Towers of Hanoi graphs

DOI10.1016/S0012-365X(99)00070-9zbMath0957.94052MaRDI 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-complete; Towers of Hanoi; codes on graphs; perfect one-error-correcting code

Mathematics Subject Classification ID

05C90: Applications of graph theory

68R10: Graph theory (including graph drawing) in computer science

94B60: Other types of codes

Related Items

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