Skip to main content

3 Result(s)

within Veena Prabhakaran Remove this filter

and

  1. No Access

    Article

    A new lower bound for the eternal vertex cover number of graphs

    The main result in this paper is a new lower bound to the eternal vertex cover number (evc number) of an arbitrary graph G in terms of the size of the smallest vertex cover in G that includes all the cut vertices...

    Jasine Babu, Veena Prabhakaran in Journal of Combinatorial Optimization (2022)

  2. No Access

    Chapter and Conference Paper

    A New Lower Bound for the Eternal Vertex Cover Number of Graphs

    We obtain a new lower bound for the eternal vertex cover number of an arbitrary graph G, in terms of the cardinality of a vertex cover of minimum size in G containing all its cut vertices. The consequences of the...

    Jasine Babu, Veena Prabhakaran in Computing and Combinatorics (2020)

  3. No Access

    Chapter and Conference Paper

    On Graphs with Minimal Eternal Vertex Cover Number

    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 to another in every round of ...

    Jasine Babu, L. Sunil Chandran… in Algorithms and Discrete Applied Mathematics (2019)