On three domination-based identification problems in block graphs
From MaRDI portal
Publication:6614535
Cites work
- scientific article; zbMATH DE number 3161569 (Why is no real title available?)
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 3906528 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 2147927 (Why is no real title available?)
- A Characterization of Block-Graphs
- Bounds for identifying codes in terms of degree parameters
- Characterizing extremal graphs for open neighbourhood location-domination
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Distance-hereditary graphs
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Domination and location in acyclic graphs
- Extremal graphs for the identifying code problem
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes in hereditary classes of graphs and VC-dimension
- Identifying codes in line graphs
- 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
- Location-domination and matching in cubic graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On a new class of codes for identifying vertices in graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- On metric properties of certain clique graphs
- On three domination-based identification problems in block graphs
- Polyhedra associated with identifying codes in graphs
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- Revisiting and improving upper bounds for identifying codes
- Study of identifying code polyhedra for some families of split graphs
- The difference between the metric dimension and the determining number of a graph
- Total domination in 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)
