3 citations · 5 across the 9 of their papers we have counts for
7 papers · 1 filter
Eternal Vertex Cover Problem on Halin Graphs
Jasine Babu, Pratik Ghosal, Cipriyano Simoes
Eternal vertex cover problem is a graph protection problem which is a dynamic two player game variant of the classical vertex cover problem. In this game, the minimum number of gua…
Eternal vertex cover number of maximal outerplanar graphs
Jasine Babu, K. Murali Krishnan, Veena Prabhakaran +1
Eternal vertex cover problem is a variant of the classical vertex cover problem modeled as a two player attacker-defender game. Computing eternal vertex cover number of graphs is k…
A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs
Jasine Babu, Veena Prabhakaran, Arko Sharma
The eternal vertex cover problem is a dynamic variant of the classical vertex cover problem. It is NP-hard to compute the eternal vertex cover number of graphs and known algorithmi…
A new lower bound for eternal vertex cover number
Jasine Babu, Veena Prabhakaran
We obtain a new lower bound for the eternal vertex cover number of an arbitrary graph , in terms of the cardinality of a vertex cover of minimum size in containing all its c…
A local characterization for perfect plane near-triangulations
Sameera M. Salam, Jasine Babu, K. Murali Krishnan
We derive a local criterion for a plane near-triangulated graph to be perfect. It is shown that a plane near-triangulated graph is perfect if and only if it does not contain either…
On Graphs whose Eternal Vertex Cover Number and Vertex Cover Number Coincide
Jasine Babu, L. Sunil Chandran, Mathew Francis +3
The eternal vertex cover problem is a variant of the classical vertex cover problem where a set of guards on the vertices have to be dynamically reconfigured from one vertex cover…