Eternal distance-\(k\) domination on graphs

DOI10.1007/s44007-023-00044-3zbMath1517.05131arXiv2104.03835OpenAlexW4367848794MaRDI QIDQ6108933

Margaret-Ellen Messinger, Erin Meger, Danielle Cox

Publication date: 30 June 2023

Published in: La Matematica (Search for Journal in Brave)

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

zbMATH Keywords

treesdominationeternal domination

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spy-game on graphs: complexity and simple topologies
• A note on the eternal dominating set problem
• Bounds on the distance two-domination number of a graph
• Eternally dominating large grids
• On the \(m\)-eternal domination number of cactus graphs
• A method for eternally dominating strong grids
• Protecting a graph with mobile guards

This page was built for publication: Eternal distance-\(k\) domination on graphs