Abstract
The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection. In this paper, eternal independent sets are introduced. These are independent sets such that the following can be iterated forever: a vertex in the independent set can be replaced with a neighboring vertex and the resulting set is independent.
Highlights
[9] Regan, F., Dynamic variants of domination and independence in graphs, graduate thesis, Rheinischen Friedrich-Wilhlems University, Bonn, 2007.
H., Winterbach, W., Infinite order domination in graphs.
[2] Chartrand, G., Lesniak, L., Graphs Digraphs.
Summary
[9] Regan, F., Dynamic variants of domination and independence in graphs, graduate thesis, Rheinischen Friedrich-Wilhlems University, Bonn, 2007. H., Winterbach, W., Infinite order domination in graphs.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
