Eternal dominating sets on digraphs and orientations of graphs

DOI10.1016/j.dam.2020.10.024zbMath1460.05141arXiv1805.09623OpenAlexW3115425321MaRDI QIDQ2659065

Hamamache Kheddouci, Alice Joffard, Guillaume Bagan

Publication date: 25 March 2021

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

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

zbMATH Keywords

directed graphseternal dominationgraph orientations\(m\)-eternal domination

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between

Cites Work

• Linear degree extractors and the inapproximability of max clique and chromatic number
• On Representatives of Subsets
• Reducibility among Combinatorial Problems
• Protecting a graph with mobile guards
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Eternal dominating sets on digraphs and orientations of graphs