New results on variants of covering codes in Sierpiński graphs
From MaRDI portal
Publication:2391669
Abstract: In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpinski graphs. We compute the minimum size of such codes in Sierpinski graphs.
Cites work
- scientific article; zbMATH DE number 416858 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 5043398 (Why is no real title available?)
- 1-perfect codes in Sierpiński graphs
- A 2-parametric generalization of Sierpiński gasket graphs.
- Adaptive identification in Torii in the King lattice
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- Coloring Sierpiński graphs and Sierpiński gasket graphs
- Covering codes in Sierpiński graphs
- Crossing numbers of Sierpiński‐like graphs
- Error-correcting codes on the Towers of Hanoi graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Fractals and Universal Spaces in Dimension Theory
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes and locating-dominating sets on paths and cycles
- Identifying codes of Cartesian product of two cliques of the same size
- Identifying codes of cycles
- Identifying codes of cycles with odd orders
- Improved bounds on identifying codes in binary Hamming spaces
- Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
- Locating sensors in paths and cycles: the case of 2-identifying codes
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- New identifying codes in the binary Hamming space
- New results on variants of covering codes in Sierpiński graphs
- On identifying codes in the King grid that are robust against edge deletions
- On perfect codes in Cartesian products of graphs
- On the size of identifying codes in triangle-free graphs
- Optimal identifying codes in cycles and paths
- Perfect codes on the towers of Hanoi graph
- The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
- The minimum density of an identifying code in the king lattice.
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
Cited in
(19)- Packing chromatic number of base-3 Sierpiński graphs
- Italian domination on Mycielskian and Sierpinski graphs
- A survey and classification of Sierpiński-type graphs
- On the zero forcing number of generalized Sierpiński graphs
- Generalized power domination: propagation radius and Sierpiński graphs
- New results on variants of covering codes in Sierpiński graphs
- Metric properties of generalized Sierpiński graphs over stars
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- Degree sequence of the generalized Sierpiński graph
- On generalized Sierpiński graphs
- On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs
- Structural properties of subdivided-line graphs
- Valency-based topological descriptors and structural property of the generalized Sierpiński networks
- On the roman domination number of generalized Sierpiński graphs
- Some properties of the generalized Sierpiński gasket graphs
- On distances in generalized Sierpiński graphs
- Information retrieval and the average number of input clues
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
This page was built for publication: New results on variants of covering codes in Sierpiński graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391669)
