Independent protection in graphs

DOI10.1016/j.disc.2014.07.011zbMath1298.05248MaRDI QIDQ400447

Bert L. Hartnell, Christina M. Mynhardt

Publication date: 21 August 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.07.011

zbMATH Keywords

eternal domination; graph protection; i-protecting set; independent protection; multicolouring independent domination

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

A new lower bound for the eternal vertex cover number of graphs, A substructure based lower bound for eternal vertex cover number

Cites Work

• Vertex covers and eternal dominating sets
• Roman domination in graphs.
• Defending the Roman Empire---a new strategy
• Graphs with equal eternal vertex cover and eternal domination numbers
• Eternally secure sets, independence sets and cliques
• Tight bounds for eternal dominating sets in graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Foolproof eternal domination in the all-guards move model
• Eternal Domination in Trees
• Protecting a graph with mobile guards
• Some covering concepts in graphs
• Combinatorial Relations and Chromatic Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item