Showing cs.DMShow all
3 papers · 1 filter
cs.DM2025
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
Tiziana Calamoneri, Federico Corò, Neeldhara Misra +2
We study the m-Eternal Domination problem, which is the following two-player game between a defender and an attacker on a graph: initially, the defender positions k guards on verti…
cs.DM2025
On a Characterization of Spartan Graphs
Neeldhara Misra, Saraswati Girish Nanoti
The eternal vertex cover game is played between an attacker and a defender on an undirected graph . The defender identifies vertices to position guards on to begin with. The…
cs.DM2023
Spartan Bipartite Graphs are Essentially Elementary
Neeldhara Misra, Saraswati Girish Nanoti
We study a two-player game on a graph between an attacker and a defender. To begin with, the defender places guards on a subset of vertices. In each move, the attacker attacks an e…