2019/10/11 by Babu, Jasine, Prabhakaran, Veena
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.1910.05042
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.