Extremal Digraphs for open neighbourhood location-domination and identifying codes

DOI10.1016/j.dam.2023.12.018arXiv2302.02152MaRDI QIDQ6202938

Narges Ghareghani, Pouyeh Sharifani, Florent Foucaud

Publication date: 27 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.02152

zbMATH Keywords

directed graphidentifying codelocating-dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic aspects of open neighborhood location-domination in graphs
• Bounds for identifying codes in terms of degree parameters
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
• Open neighborhood locating-dominating in trees
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
• Domination and location in twin-free digraphs
• On graphs having a \(V\setminus \{x\}\) set as an identifying code
• On separating systems
• Discriminating codes in (bipartite) planar graphs
• Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
• On strongly identifying codes
• On the minimum size of an identifying code over all orientations of a graph
• Characterizing extremal graphs for open neighbourhood location-domination
• Open locating-dominating sets in circulant graphs
• Locating-dominating sets: from graphs to oriented graphs
• Optimal open-locating-dominating sets in infinite triangular grids
• Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• A linear algorithm for minimum 1-identifying codes in oriented trees
• Induced subsets
• Domination and location in acyclic graphs
• On a new class of codes for identifying vertices in graphs
• Identifying and locating-dominating codes: NP-completeness results for directed graphs
• On open neighborhood locating-dominating in graphs
• Dominating Set and Converse Dominating Set of a Directed Graph
• Locating-dominating sets in local tournaments

This page was built for publication: Extremal Digraphs for open neighbourhood location-domination and identifying codes