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

DOI10.1142/S1793830923500301MaRDI QIDQ6560780

H. Kheddouci, M. Lalou, Nour Dyab

Publication date: 24 June 2024

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

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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Independent protection in graphs
• Eternal dominating sets on digraphs and orientations of graphs
• Dynamic dominating sets: the eviction model for eternal domination
• Eternal protection in grid graphs
• Eternal total domination in graphs.
• Eternal Independent Sets in 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)