Characterizing extremal graphs for open neighbourhood location-domination
From MaRDI portal
Publication:2043360
DOI10.1016/j.dam.2021.06.006zbMath1469.05086arXiv2101.05322OpenAlexW3175707366MaRDI QIDQ2043360
Aida Roshany-Tabrizi, Narges Ghareghani, Pouyeh Sharifani, Florent Foucaud
Publication date: 2 August 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.05322
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
On three domination-based identification problems in block graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes
Cites Work
- Algorithmic aspects of open neighborhood location-domination in graphs
- 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
- On separating systems
- Locating-dominating sets in twin-free graphs
- On strongly identifying codes
- Open locating-dominating sets in circulant graphs
- Optimal open-locating-dominating sets in infinite triangular grids
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Extremal graphs for the identifying code problem
- Locating and total dominating sets in trees
- Induced subsets
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- On open neighborhood locating-dominating in graphs
- On Stronger Types of Locating-dominating Codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterizing extremal graphs for open neighbourhood location-domination
