Liar's domination
From MaRDI portal
Publication:3057104
DOI10.1002/net.20295zbMath1204.90061OpenAlexW4240607287MaRDI QIDQ3057104
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20295
Discrete location and assignment (90B80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (18)
Liar's dominating sets in graphs ⋮ Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Liar's dominating set problem on unit disk graphs ⋮ Liar's domination in graphs: complexity and algorithm ⋮ Liar’s Domination in 2D ⋮ Liar's domination in unit disk graphs ⋮ On upper bounds for multiple domination numbers of graphs ⋮ A linear time algorithm for liar's domination problem in proper interval graphs ⋮ On the total liar's domination of graphs ⋮ Hardness results, approximation and exact algorithms for liar's domination problem in graphs ⋮ Hardness results and approximation algorithm for total liar's domination in graphs ⋮ Various bounds for liar's domination number ⋮ Locating-Domination and Identification ⋮ On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs ⋮ Unnamed Item ⋮ Liar's domination in graphs ⋮ CONNECTED LIAR'S DOMINATION IN GRAPHS: COMPLEXITY AND ALGORITHMS
Cites Work
- On the covering of vertices for fault diagnosis in hypercubes
- Identifying codes in some subgraphs of the square lattice
- On locating--dominating sets in infinite grids
- On robust identification in the square and King grids
- Codes identifying sets of vertices in random networks
- On identifying codes in the hexagonal mesh
- Liar's domination in graphs
- New bounds for codes identifying vertices in graphs
- On the identification problems in products of cycles
- Well-located graphs: A collection of well-covered ones
- Fault-tolerant locating-dominating sets
- Families of optimal codes for strong identification
- On identification in the triangular grid
- On the density of identifying codes in the square lattice
- On the identification of sets of points in the square lattice
- Identifying and locating-dominating codes on chains and cycles
- An optimal locating-dominating set in the infinite triangular grid
- Locating and total dominating sets in trees
- 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
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On robust and dynamic identifying codes
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- Two families of optimal identifying codes in binary Hamming spaces
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Bounds on identifying codes
- 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
This page was built for publication: Liar's domination
