3 papers
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.DS2025
Revisiting Token Sliding on Chordal Graphs
Rajat Adak, Saraswati Girish Nanoti, Prafullkumar Tale
In this article, we revisit the complexity of the reconfiguration of independent sets under the token sliding rule on chordal graphs. In the \textsc{Token Sliding-Connectivity} pro…