scientific article; zbMATH DE number 5533277
From MaRDI portal
Publication:3616664
Recommendations
- Liar's domination in graphs
- Liar's domination in graphs
- On the relations between liars' dominating and set-sized dominating parameters
- Liar's domination
- Liar's dominating sets in graphs
- Various bounds for liar's domination number
- Liar's domination in 2D
- Liar's domination in Sierpinski-like graphs
- Liar's domination in ladders
- Liar's domination in graphs under some operations
Cited in
(12)- Liar's domination
- Various bounds for liar's domination number
- Fault tolerant detectors for distinguishing sets in graphs
- Locating mobile intruders using dominating sets
- Hardness results and approximation algorithm for total 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
- On the total liar's domination of graphs
- Liar's domination in ladders
- Locating and liar domination of circulant networks.
- Liar's domination in graphs: complexity and algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616664)
