Error-correcting codes on the Towers of Hanoi graphs
From MaRDI portal
(Redirected from Publication:1808786)
Recommendations
Cited in
(21)- 1-perfect codes in Sierpiński graphs
- Error-correcting codes from graphs
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups
- Perfect codes in direct products of cycles-a complete characterization
- SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
- Shortest paths in Sierpiński graphs
- Total perfect codes in graphs realized by commutative rings
- The (non-)existence of perfect codes in Fibonacci cubes
- scientific article; zbMATH DE number 7734740 (Why is no real title available?)
- Coloring Hanoi and Sierpiński 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
- A survey and classification of Sierpiński-type graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- An almost complete description of perfect codes in direct products of cycles
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- The linear \(t\)-colorings of Sierpiński-like graphs
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- On the planarity of Hanoi graphs
- On perfect codes in Cartesian products of graphs
This page was built for publication: Error-correcting codes on the Towers of Hanoi graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808786)