Two step graph protection game

DOI10.1007/978-3-031-83438-7_19MaRDI QIDQ6969492zbMATH OpenFDO

Authors Aakash Ghosh, Saraswati Girish Nanoti

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A new lower bound for the eternal vertex cover number of graphs
• Computational Complexity
• Defending the Roman Empire from multiple attacks
• Edge protection in graphs
• Eternal vertex cover on bipartite graphs
• Graph theory
• On graphs whose eternal vertex cover number and vertex cover number coincide
• On graphs with minimal eternal vertex cover number
• On the weak Roman domination number of lexicographic product graphs
• Parameterized algorithm for eternal vertex cover
• Parameterized algorithms
• Protecting a graph with mobile guards
• R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
• Spartan bipartite graphs are essentially elementary

This page was built for publication: Two step graph protection game

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