Eternal Independent Sets in Graphs
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 follo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2016-01-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol3/iss1/3 |
| id |
doaj-e03cb088238941c6a0a2d80a7c74b9a8 |
|---|---|
| record_format |
Article |
| spelling |
doaj-e03cb088238941c6a0a2d80a7c74b9a82020-11-25T01:57:20ZengGeorgia Southern UniversityTheory and Applications of Graphs2470-98592016-01-013110.20429/tag.2016.030103Eternal Independent Sets in GraphsYair CaroWilliam KlostermeyerThe 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.https://digitalcommons.georgiasouthern.edu/tag/vol3/iss1/3independent seteternal dominating set |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Yair Caro William Klostermeyer |
| spellingShingle |
Yair Caro William Klostermeyer Eternal Independent Sets in Graphs Theory and Applications of Graphs independent set eternal dominating set |
| author_facet |
Yair Caro William Klostermeyer |
| author_sort |
Yair Caro |
| title |
Eternal Independent Sets in Graphs |
| title_short |
Eternal Independent Sets in Graphs |
| title_full |
Eternal Independent Sets in Graphs |
| title_fullStr |
Eternal Independent Sets in Graphs |
| title_full_unstemmed |
Eternal Independent Sets in Graphs |
| title_sort |
eternal independent sets in graphs |
| publisher |
Georgia Southern University |
| series |
Theory and Applications of Graphs |
| issn |
2470-9859 |
| publishDate |
2016-01-01 |
| description |
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. |
| topic |
independent set eternal dominating set |
| url |
https://digitalcommons.georgiasouthern.edu/tag/vol3/iss1/3 |
| work_keys_str_mv |
AT yaircaro eternalindependentsetsingraphs AT williamklostermeyer eternalindependentsetsingraphs |
| _version_ |
1724974649067962368 |