The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
From MaRDI portal
Publication:2132340
DOI10.1016/j.entcs.2019.08.013OpenAlexW2963644170WikidataQ113317419 ScholiaQ113317419MaRDI QIDQ2132340
Publication date: 27 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.013
Related Items (2)
On three domination-based identification problems in block graphs ⋮ On locating-dominating set of regular graphs
Cites Work
- A polyhedral approach to locating-dominating sets in graphs
- Locating-total domination in graphs
- Identifying codes and locating-dominating sets on paths and cycles
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- On \(r\)-locating-dominating sets in paths
- 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.
- Polyhedra associated with identifying codes in graphs
- Identifying and locating-dominating codes on chains and cycles
- Optimal identifying codes in cycles and paths
- Identifying codes of cycles
- Locating and total dominating sets in trees
- The Complexity of the Identifying Code Problem in Restricted Graph Classes
- Study of Identifying Code Polyhedra for Some Families of Split Graphs
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks
- On a new class of codes for identifying vertices in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
