Liar's domination in graphs
From MaRDI portal
Publication:1045132
DOI10.1016/j.disc.2008.07.019zbMath1211.05123OpenAlexW1983805335MaRDI QIDQ1045132
Peter J. Slater, Miranda L. Roden
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.019
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 ⋮ Liar's domination ⋮ Various bounds for liar's domination number ⋮ Locating-Domination and Identification ⋮ On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs ⋮ Unnamed Item ⋮ CONNECTED LIAR'S DOMINATION IN GRAPHS: COMPLEXITY AND ALGORITHMS
Cites Work
This page was built for publication: Liar's domination in graphs