Locating-dominating sets in some subclasses of split graphs
From MaRDI portal
Cites work
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Domination and location in acyclic graphs
- scientific article; zbMATH DE number 4053685 (Why is no real title available?)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Locating-dominating sets in twin-free graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- The difference between the metric dimension and the determining number of a graph
This page was built for publication: Locating-dominating sets in some subclasses of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7402530)