A new lower bound for eternal vertex cover number (1910.05042v2)

Abstract: 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 lower bound includes a quadratic time algorithm for computing the eternal vertex cover number of chordal graphs.