Skip to main content

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)