A new lower bound for eternal vertex cover number
Discrete Mathematics
2020-07-07 v2
Abstract
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 cut vertices. The consequences of the lower bound includes a quadratic time algorithm for computing the eternal vertex cover number of chordal graphs.
Cite
@article{arxiv.1910.05042,
title = {A new lower bound for eternal vertex cover number},
author = {Jasine Babu and Veena Prabhakaran},
journal= {arXiv preprint arXiv:1910.05042},
year = {2020}
}