1-perfect codes in Sierpiński graphs
From MaRDI portal
Publication:4806494
DOI10.1017/S0004972700040235zbMath1033.94018OpenAlexW2056566034MaRDI QIDQ4806494
Ciril Petr, Uroš Milutinović, Sandi Klavžar
Publication date: 2002
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700040235
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25) Decoding (94B35)
Related Items (47)
Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ Italian domination and perfect Italian domination on Sierpiński graphs ⋮ On generalized Sierpiński graphs ⋮ Sierpiński products of r-uniform hypergraphs ⋮ Relating the outer-independent total Roman domination number with some classical parameters of graphs ⋮ The Sierpiński product of graphs ⋮ On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs ⋮ Total perfect codes in Cayley graphs ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ An almost complete description of perfect codes in direct products of cycles ⋮ Hereditary Efficiently Dominatable Graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ The average eccentricity of Sierpiński graphs ⋮ Sharp bounds on certain degree based topological indices for generalized Sierpiński graphs ⋮ On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Security in Sierpiński graphs ⋮ On perfect codes in Cartesian products of graphs ⋮ Minimum Linear Arrangement of Generalized Sierpinski Graphs ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ The hub number of Sierpiński-like graphs ⋮ Perfect codes in direct products of cycles-a complete characterization ⋮ Metric properties of Sierpiński-like graphs ⋮ On weak odd domination and graph-based quantum secret sharing ⋮ Coloring the square of Sierpiński graphs ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ The Wiener index of Sierpiński-like graphs ⋮ On distances in generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Generalized power domination: propagation radius and Sierpiński 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 ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ The (non-)existence of perfect codes in Fibonacci cubes ⋮ Shortest paths in Sierpiński graphs ⋮ Degree sequence of the generalized Sierpiński graph ⋮ On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs ⋮ Characterizing \(r\)-perfect codes in direct products of two and three cycles ⋮ The double Roman domination number of generalized Sierpiński graphs ⋮ Italian domination on Mycielskian and Sierpinski graphs ⋮ On the roman domination number of generalized Sierpiński graphs ⋮ The outer-connected domination number of Sierpiński-like graphs
Cites Work
- Unnamed Item
- Perfect codes over graphs
- On the non-existence of perfect and nearly perfect codes
- Regular codes in regular graphs are difficult
- Error-correcting codes on the Towers of Hanoi graphs
- Perfect codes in graphs
- Perfect codes in the graphs Ok and L(Ok)
- Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
- Codes in Bipartite Distance-Regular Graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
This page was built for publication: 1-perfect codes in Sierpiński graphs
