Liar's dominating sets in graphs
From MaRDI portal
Publication:335352
DOI10.1016/j.dam.2016.04.023zbMath1348.05145OpenAlexW2379900404MaRDI QIDQ335352
Doost Ali Mojdeh, Mustapha Chellali, Abdollah Alimadadi
Publication date: 2 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.023
Related Items (6)
Liar's dominating set problem on unit disk graphs ⋮ Liar’s Domination in 2D ⋮ Liar's domination in unit disk graphs ⋮ On the total liar's domination of graphs ⋮ On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Liar's domination in graphs
- On packing and covering numbers of graphs
- Packing in trees
- Liar's domination in graphs: complexity and algorithm
- A linear time algorithm for liar's domination problem in proper interval graphs
- Johnson graphs are Hamilton-connected
- Liar's domination
This page was built for publication: Liar's dominating sets in graphs