Locating-dominating sets in local tournaments
From MaRDI portal
Publication:6162022
DOI10.1016/j.dam.2023.04.010zbMath1521.05134arXiv2109.03102OpenAlexW4286984550MaRDI QIDQ6162022
Thomas Bellitto, Aline Parreau, Benjamin Lévêque, Caroline Brosse
Publication date: 15 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.03102
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- The difference between the metric dimension and the determining number of a graph
- Domination and location in twin-free digraphs
- Locating-dominating sets in twin-free graphs
- A classification of locally semicomplete digraphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Digraphs
This page was built for publication: Locating-dominating sets in local tournaments