Article Dans Une Revue Discrete Mathematics, Algorithms and Applications Année : 2023

Eternal feedback vertex sets: A new graph protection model using guards

Résumé

Communicated by Dachuan Xu Graph protection using mobile guards has received a lot of attention in the literature. It has been considered in different forms, including Eternal Dominating set, Eternal Independent set and Eternal Vertex Cover set. In this paper, we introduce and study two new models of graph protection, namely Eternal Feedback Vertex Sets (EFVS) and m-Eternal Feedback Vertex Sets (m-EFVS). Both models are based on an initial selection of a feedback vertex set (FVS), where a vertex in FVS can be replaced with a neighboring vertex such that the resulting set is a FVS too. We prove bounds for both the eternal and m-eternal feedback vertex numbers on, mainly, distance graphs, circulant graphs and grids. Also, we deduce other inequalities for both parameters on cycles, complete graphs and complete bipartite graphs.

Fichier principal
Vignette du fichier
EFVS, new template.pdf (479.38 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04197619 , version 1 (08-09-2023)

Licence

Identifiants

Citer

Nour Dyab, Mohammed Lalou, Hamamache Kheddouci. Eternal feedback vertex sets: A new graph protection model using guards. Discrete Mathematics, Algorithms and Applications, 2023, pp.2350030. ⟨10.1142/s1793830923500301⟩. ⟨hal-04197619⟩
114 Consultations
781 Téléchargements

Altmetric

Partager

  • More