Various bounds for liar's domination number

DOI10.7151/dmgt.1878zbMath1339.05274OpenAlexW2317643124MaRDI QIDQ726641

Abdollah Alimadadi, Doost Ali Mojdeh, Nader Jafari Rad

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

zbMATH Keywords

diameterregular graphliar's dominationNordhaus-Gaddum

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Bounds on co-independent liar's domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph
• Induced paths in twin-free graphs
• Liar's domination in graphs
• Optimal identifying codes in cycles and paths
• Liar's domination in graphs: complexity and algorithm
• Hardness results and approximation algorithm for total liar's domination in graphs
• A linear time algorithm for liar's domination problem in proper interval graphs
• Liar's domination
• On a new class of codes for identifying vertices in graphs
• False alarms in fault-tolerant dominating sets in graphs
• On codes identifying sets of vertices in Hamming spaces

This page was built for publication: Various bounds for liar's domination number