A polyhedral approach to locating-dominating sets in graphs
From MaRDI portal
Publication:324734
DOI10.1016/j.endm.2015.07.016zbMath1347.05135MaRDI QIDQ324734
Annegret K. Wagler, Silvia M. Bianchi, Gabriela R. Argiroffo
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.016
05C82: Small world graphs, complex networks (graph-theoretic aspects)
52B99: Polytopes and polyhedra
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Linear-time algorithms for three domination-based separation problems in block graphs, Locating-dominating sets of functigraphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the facial structure of the set covering polytope
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Identifying and locating-dominating codes on chains and cycles
- Locating and total dominating sets in trees
- Domination and location in acyclic graphs