A note on the locating-total domination in graphs
From MaRDI portal
Publication:2364093
Recommendations
Cites work
- Bounds on the locating-total domination number of a tree
- Fault-tolerant locating-dominating sets
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- Locating and total dominating sets in trees
- Locating-total domination in claw-free cubic graphs
- Locating-total domination in graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On locating and differetiating-total domination in trees
- The bipancycle-connectivity of the hypercube
Cited in
(13)- On locating-dominating set of regular graphs
- Locating-dominating sets: from graphs to oriented graphs
- Domination parameters in hypertrees and sibling trees
- Locating-total domination in grid graphs
- A note on the complexity of locating-total domination in graphs
- Locating-dominating sets of functigraphs
- scientific article; zbMATH DE number 5575545 (Why is no real title available?)
- scientific article; zbMATH DE number 3906528 (Why is no real title available?)
- scientific article; zbMATH DE number 7493307 (Why is no real title available?)
- The dominating partition dimension and locating-chromatic number of graphs
- Algorithmic results on locating-total domination in graphs
- Progress towards the two-thirds conjecture on locating-total dominating sets
- An extension of locating-total domination problem and its complexity
This page was built for publication: A note on the locating-total domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364093)