DeepAI AI Chat
Log In Sign Up

A new lower bound for eternal vertex cover number

by   Jasine Babu, et al.
The Fleet Street

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.


page 1

page 2

page 3

page 4


A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs

The eternal vertex cover problem is a dynamic variant of the classical v...

A modified greedy algorithm to improve bounds for the vertex cover number

In any attempt at designing an efficient algorithm for the minimum verte...

Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover

We show that a graph with n vertices and vertex cover of size k has at m...

Stochastic Minimum Vertex Cover in General Graphs: a 3/2-Approximation

Our main result is designing an algorithm that returns a vertex cover of...

The k-conversion number of regular graphs

Given a graph G=(V,E) and a set S_0⊆ V, an irreversible k-threshold conv...

A lower bound for essential covers of the cube

Essential covers were introduced by Linial and Radhakrishnan as a model ...

Exact approaches for the Connected Vertex Cover problem

Given a graph G, the Connected Vertex Cover problem (CVC) asks to find a...