On three domination-based identification problems in block graphs
From MaRDI portal
Publication:6614535
DOI10.3233/FI-242179MaRDI QIDQ6614535FDOQ6614535
Authors: Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K. Wagler
Publication date: 7 October 2024
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Cites Work
- 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
- On a new class of codes for identifying vertices in graphs
- Total domination in graphs
- Identifying codes in line graphs
- Distance-hereditary graphs
- Identifying and locating-dominating codes on chains and cycles
- Title not available (Why is that?)
- A Characterization of Block-Graphs
- Extremal graphs for the identifying code problem
- The difference between the metric dimension and the determining number of a graph
- On metric properties of certain clique graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination and location in acyclic graphs
- Location-domination and matching in cubic graphs
- Title not available (Why is that?)
- Bounds for identifying codes in terms of degree parameters
- Title not available (Why is that?)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- Identifying codes in hereditary classes of graphs and VC-dimension
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Revisiting and improving upper bounds for identifying codes
- Polyhedra associated with identifying codes in graphs
- Study of identifying code polyhedra for some families of split graphs
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Characterizing extremal graphs for open neighbourhood location-domination
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- Linear-time algorithms for three domination-based separation problems in block graphs
- On three domination-based identification problems in block graphs
This page was built for publication: On three domination-based identification problems in block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614535)