Eternal Independent Sets in Graphs

DOI10.20429/TAG.2016.030103MaRDI QIDQ5225519zbMATH OpenOpenAlexFDO

Authors Yair Caro, William F. Klostermeyer

Publication date 22 July 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2016.030103

zbMATH Keywords

eternal dominating setseternal vertex coversgraph protection

Mathematics Subject Classification ID

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

Recommendations

• An eternal vertex cover problem
• Edge protection in graphs
• scientific article; zbMATH DE number 5575574
• Graphs with equal eternal vertex cover and eternal domination numbers
• Eternal domination in trees

Cited in

(9)

• Essential independent sets and long cycles
• A substructure based lower bound for eternal vertex cover number
• Edge protection in graphs
• Independent protection in graphs
• Disjoint dominating sets with a perfect matching
• scientific article; zbMATH DE number 2174620 (Why is no real title available?)
• An eternal vertex cover problem
• Eternal feedback vertex sets: a new graph protection model using guards
• Computing eternal vertex cover number of maximal outerplanar graphs in linear time

This page was built for publication: Eternal Independent Sets in Graphs

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