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

DOI10.1142/S1793830923500301MaRDI QIDQ6560780FDOQ6560780

Authors: Nour Dyab, M. Lalou, H. Kheddouci 

Publication date: 24 June 2024

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Recommendations

• An eternal vertex cover problem
• Eternal Independent Sets in Graphs
• Edge protection in graphs
• Graphs with equal eternal vertex cover and eternal domination numbers
• Foolproof eternal domination in the all-guards move model

zbMATH Keywords

gridsbipartite graphsdistance graphsgraph protectioneternal security problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Eternal total domination in graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Eternal protection in grid graphs
• Eternal security in graphs of fixed independence number
• Independent protection in graphs
• Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
• Dynamic dominating sets: the eviction model for eternal domination
• An eternal vertex cover problem
• Eternal Independent Sets in Graphs
• Eternal dominating sets on digraphs and orientations of graphs

This page was built for publication: Eternal feedback vertex sets: a new graph protection model using guards

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