A polyhedral approach to locating-dominating sets in graphs
From MaRDI portal
Publication:324734
DOI10.1016/J.ENDM.2015.07.016zbMATH Open1347.05135OpenAlexW2203809600MaRDI QIDQ324734FDOQ324734
Authors: Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret K. Wagler 
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.016
Recommendations
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs
- The binary locating-dominating number of some convex polytopes
- Domination and location in acyclic graphs
- scientific article; zbMATH DE number 861343
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Polytopes and polyhedra (52B99)
Cites Work
- 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
- Title not available (Why is that?)
- On the facial structure of the set covering polytope
- Title not available (Why is that?)
- Locating and total dominating sets in trees
- Domination and location in acyclic graphs
Cited In (10)
- An optimal locating-dominating set in the infinite triangular grid
- Linear-time algorithms for three domination-based separation problems in block graphs
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
- Locating-dominating sets of functigraphs
- An extension of locating-total domination problem and its complexity
- A note on the complexity of locating-total domination in graphs
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- Title not available (Why is that?)
- On locating-dominating set of regular graphs
- Locating-dominating sets: from graphs to oriented graphs
This page was built for publication: A polyhedral approach to locating-dominating sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324734)
