On three domination-based identification problems in block graphs
type: Item
instance of: scholarly article
title: On three domination-based identification problems in block graphs
author: Dipayan Chakraborty
author: Florent Foucaud
author: Aline Parreau
author: Annegret K. Wagler
published in: Fundamenta Informaticae
publication date: 2024-10-07T00:00:00Z
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7922322
zbMATH Keywords: identifying code
zbMATH Keywords: locating-dominating code
zbMATH Keywords: open locating-dominating code
zbMATH Keywords: block graph
MaRDI profile type: MaRDI publication profile
cites work: Q3279628
cites work: On a new class of codes for identifying vertices in graphs
cites work: Domination and location in acyclic graphs
cites work: Q3803159
cites work: Q3565861
cites work: Total Domination in Graphs
cites work: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
cites work: Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
cites work: Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
cites work: Identifying and locating-dominating codes on chains and cycles
cites work: On graphs having a \(V\setminus \{x\}\) set as an identifying code
cites work: Polyhedra associated with identifying codes in graphs
cites work: Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
cites work: Study of Identifying Code Polyhedra for Some Families of Split Graphs
cites work: Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
cites work: Q4659582
cites work: Identifying Codes in Line Graphs
cites work: Q3684148
cites work: Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
cites work: Locating-dominating sets and identifying codes in graphs of girth at least 5
cites work: Revisiting and Improving Upper Bounds for Identifying Codes
cites work: Bounds for identifying codes in terms of degree parameters
cites work: Location-domination and matching in cubic graphs
cites work: The difference between the metric dimension and the determining number of a graph
cites work: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
cites work: A Characterization of Block-Graphs
cites work: On metric properties of certain clique graphs
cites work: Distance-hereditary graphs
cites work: Linear-time algorithms for three domination-based separation problems in block graphs
cites work: On three domination-based identification problems in block graphs
cites work: Extremal graphs for the identifying code problem
cites work: Characterizing extremal graphs for open neighbourhood location-domination
DOI: 10.3233/FI-242179
description: scientific article; zbMATH DE number 7922322