Locating-dominating sets: from graphs to oriented graphs
From MaRDI portal
Publication:2092344
DOI10.1016/j.disc.2022.113124zbMath1502.05179arXiv2112.01910OpenAlexW4225860123MaRDI QIDQ2092344
Quentin Deschamps, Aline Parreau, Nicolas Bousquet, Tuomo Lehtilä
Publication date: 2 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.01910
Related Items (3)
Revisiting and Improving Upper Bounds for Identifying Codes ⋮ On finding the best and worst orientations for the metric dimension ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The difference between the metric dimension and the determining number of a graph
- Directed domination in oriented graphs
- Claw-free graphs. VI: Colouring
- Domination and location in twin-free digraphs
- Codes identifying sets of vertices in random networks
- Locating-dominating sets in twin-free graphs
- Fault-tolerant locating-dominating sets
- On the minimum size of an identifying code over all orientations of a graph
- On the degrees of the vertices of a directed graph
- Vizing bound for the chromatic number on some graph classes
- Domination and location in acyclic graphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- An induced subgraph characterization of domination perfect graphs
- On a Problem in Graph Theory
- Metric dimension: from graphs to oriented graphs
- Path factors in claw-free graphs
This page was built for publication: Locating-dominating sets: from graphs to oriented graphs
