Recommendations
Cites work
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 5533277 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- A linear time algorithm for liar's domination problem in proper interval graphs
- False alarms in fault-tolerant dominating sets in graphs
- Graph theory
- Hardness results and approximation algorithm for total liar's domination in graphs
- Induced paths in twin-free graphs
- Liar's domination
- Liar's domination in graphs
- Liar's domination in graphs: complexity and algorithm
- Liar's domination in ladders
- On a new class of codes for identifying vertices in graphs
- On codes identifying sets of vertices in Hamming spaces
- Optimal identifying codes in cycles and paths
Cited in
(8)- scientific article; zbMATH DE number 5533277 (Why is no real title available?)
- Bounds on co-independent liar's domination in graphs
- Set-sized \((1,3)\)-domination for trees
- On the relations between liars' dominating and set-sized dominating parameters
- Liar's domination in graphs
- Liar's domination in ladders
- Liar's domination in graphs under some operations
- Liar's domination in Sierpinski-like graphs
This page was built for publication: Various bounds for liar's domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726641)
