New results on variants of covering codes in Sierpiński graphs
From MaRDI portal
Publication:2391669
DOI10.1007/s10623-012-9642-1zbMath1269.05095arXiv1201.1202MaRDI QIDQ2391669
Aline Parreau, Michel Mollard, Sylvain Gravier, Julien Moncel, Matjaž Kovše
Publication date: 5 August 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.1202
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
94B25: Combinatorial codes
Related Items
On the zero forcing number of generalized Sierpinski graphs, Degree sequence of the generalized Sierpiński graph, Information retrieval and the average number of input clues, A survey and classification of Sierpiński-type graphs, Graphs that are simultaneously efficient open domination and efficient closed domination graphs, Structural properties of subdivided-line graphs, Metric properties of generalized Sierpiński graphs over stars, Generalized power domination: propagation radius and Sierpiński graphs, Valency-based topological descriptors and structural property of the generalized Sierpiński networks, On generalized Sierpiński graphs, New results on variants of covering codes in Sierpiński graphs, On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs, Packing chromatic number of base-3 Sierpiński graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the size of identifying codes in triangle-free graphs
- Adaptive identification in Torii in the King lattice
- On perfect codes in Cartesian products of graphs
- Identifying codes and locating-dominating sets on paths and cycles
- Coloring Sierpiński graphs and Sierpiński gasket graphs
- Identifying codes of cycles with odd orders
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
- Identifying codes of Cartesian product of two cliques of the same size
- On identifying codes in the King grid that are robust against edge deletions
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- The minimum density of an identifying code in the king lattice.
- Error-correcting codes on the Towers of Hanoi graphs
- Identifying and locating-dominating codes on chains and cycles
- Optimal identifying codes in cycles and paths
- New results on variants of covering codes in Sierpiński graphs
- Locating sensors in paths and cycles: the case of 2-identifying codes
- Identifying codes of cycles
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- The Tower of Hanoi – Myths and Maths
- Fractals and Universal Spaces in Dimension Theory
- Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
- Perfect codes on the towers of Hanoi graph
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Crossing numbers of Sierpiński‐like graphs
