Independent protection in graphs

DOI10.1016/J.DISC.2014.07.011MaRDI QIDQ400447zbMATH OpenOpenAlexFDO

Authors 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 dominationgraph protectioni-protecting setindependent protectionmulticolouring independent domination

Mathematics Subject Classification ID

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

Recommendations

• Edge protection in graphs
• Eternal Independent Sets in Graphs
• Secure vertex cover of a graph
• An eternal vertex cover problem
• Foolproof eternal domination in the all-guards move model

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 5575574 (Why is no real title available?)
• scientific article; zbMATH DE number 3614795 (Why is no real title available?)
• scientific article; zbMATH DE number 1286748 (Why is no real title available?)
• scientific article; zbMATH DE number 2174620 (Why is no real title available?)
• scientific article; zbMATH DE number 2104838 (Why is no real title available?)
• scientific article; zbMATH DE number 2114685 (Why is no real title available?)
• Combinatorial Relations and Chromatic Graphs
• Defending the Roman Empire---a new strategy
• Eternal domination in trees
• Eternal domination numbers of 4 n grid graphs
• Eternal domination on 3 n grid graphs
• Eternal protection in grid graphs
• Eternal security in graphs of fixed independence number
• Eternally secure sets, independence sets and cliques
• Foolproof eternal domination in the all-guards move model
• Graphs with equal eternal vertex cover and eternal domination numbers
• Maximum-demand graphs for eternal security
• Protecting a graph with mobile guards
• Roman domination in graphs.
• Some covering concepts in graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Tight bounds for eternal dominating sets in graphs
• Vertex covers and eternal dominating sets

Cited in

(5)

• A substructure based lower bound for eternal vertex cover number
• Eternal feedback vertex sets: a new graph protection model using guards
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• A new lower bound for the eternal vertex cover number of graphs
• Computing eternal vertex cover number of maximal outerplanar graphs in linear time

This page was built for publication: Independent protection in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400447)