On three domination-based identification problems in block graphs
From MaRDI portal
Publication:6132542
DOI10.1007/978-3-031-25211-2_21arXiv1811.09537OpenAlexW4304776743MaRDI QIDQ6132542
Dipayan Chakraborty, Aline Parreau, Florent Foucaud, Annegret K. Wagler
Publication date: 17 August 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.09537
block graphdomination numbermaximal cliqueidentifying codeorder of a grapharticulationlocating-dominating
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The difference between the metric dimension and the determining number of a graph
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Location-domination and matching in cubic graphs
- On metric properties of certain clique graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Characterizing extremal graphs for open neighbourhood location-domination
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
- Linear-time algorithms for three domination-based separation problems in block graphs
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Study of Identifying Code Polyhedra for Some Families of Split Graphs
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- Domination and location in acyclic graphs
- A Characterization of Block-Graphs
- On a new class of codes for identifying vertices in graphs
- Revisiting and Improving Upper Bounds for Identifying Codes
- Identifying Codes in Line Graphs
This page was built for publication: On three domination-based identification problems in block graphs
