Various bounds for liar's domination number
From MaRDI portal
Publication:726641
DOI10.7151/DMGT.1878zbMATH Open1339.05274OpenAlexW2317643124MaRDI QIDQ726641FDOQ726641
A. Alimadadi, Nader Jafari Rad, Doost Ali Mojdeh
Publication date: 13 July 2016
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1878
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a new class of codes for identifying vertices in graphs
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- Title not available (Why is that?)
- Liar's domination in graphs
- Liar's domination in graphs: complexity and algorithm
- A linear time algorithm for liar's domination problem in proper interval graphs
- Liar's domination
- On codes identifying sets of vertices in Hamming spaces
- Optimal identifying codes in cycles and paths
- Induced paths in twin-free graphs
- Hardness results and approximation algorithm for total liar's domination in graphs
- Liar's domination in ladders
- Title not available (Why is that?)
- False alarms in fault-tolerant dominating sets in graphs
Cited In (2)
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)
