Domination and location in twin-free digraphs

DOI10.1016/j.dam.2020.03.025zbMath1443.05142arXiv1910.05311OpenAlexW2979387495MaRDI QIDQ777359

Shahrzad Heydarshahi, Aline Parreau, Florent Foucaud

Publication date: 7 July 2020

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

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

zbMATH Keywords

boundsdigraphsdominating setslocating-dominating sets

Mathematics Subject Classification ID

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

Related Items

On finding the best and worst orientations for the metric dimension ⋮ Locating-dominating sets in local tournaments ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ Improved lower bound for locating-dominating codes in binary Hamming spaces ⋮ Locating-dominating sets: from graphs to oriented graphs

Cites Work

• 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
• Location-domination in line graphs
• Locating-dominating sets in twin-free graphs
• Location-domination and matching in cubic graphs
• On finding a minimum dominating set in a tournament
• Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
• Induced subsets
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Domination and location in acyclic graphs
• Identifying and locating-dominating codes: NP-completeness results for directed graphs
• Dominating Set and Converse Dominating Set of a Directed Graph