Domination parameters in hypertrees
From MaRDI portal
Recommendations
Cites work
- A characterization of locating-total domination edge critical graphs
- 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 3400923 (Why is no real title available?)
- Identifying codes and locating-dominating sets on paths and cycles
- Locating and identifying codes in circulant networks
- Locating and total dominating sets in trees
- Locating-dominating codes in cycles
- 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 covering sets and error-correcting codes
- On locating--dominating sets in infinite grids
- Towards a theory of domination in graphs
Cited in
(4)
This page was built for publication: Domination parameters in hypertrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795956)