Fault tolerant detectors for distinguishing sets in graphs
From MaRDI portal
Publication:891327
DOI10.7151/DMGT.1838zbMath1327.05266OpenAlexW2578057204MaRDI QIDQ891327
Publication date: 17 November 2015
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1838
detection distinguishing open-locating-dominating setdistinguishing setsfault tolerant detectorsredundant distinguishing open-locating-dominating set
Related Items (5)
Extremal cubic graphs for fault-tolerant locating domination ⋮ Resolving sets tolerant to failures in three-dimensional grids ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ On redundant locating-dominating sets ⋮ Progress on fault-tolerant locating-dominating sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Open neighborhood locating-dominating in trees
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- On locating--dominating sets in infinite grids
- An optimal strongly identifying code in the infinite triangular grid
- Liar's domination in graphs
- Fault-tolerant locating-dominating sets
- On strongly identifying codes
- Identifying and locating-dominating codes on chains and cycles
- Hardness results and approximation algorithm for total liar's domination in graphs
- Optimal open-locating-dominating sets in infinite triangular grids
- On identifying codes that are robust against edge changes
- An optimal locating-dominating set in the infinite triangular grid
- Nordhaus-Gaddum bounds for locating domination
- A linear time algorithm for liar's domination problem in proper interval graphs
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- Graphical parameters for classes of tumbling block graphs
- Liar's domination
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- Centroidal bases in graphs
- On open neighborhood locating-dominating in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
This page was built for publication: Fault tolerant detectors for distinguishing sets in graphs
