Skip to main content

4 Result(s)

within Jasine Babu Remove this filter Theory of Computation Remove this filter

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)

  2. No Access

    Chapter and Conference Paper

    Eternal Vertex Cover on Bipartite Graphs

    The Eternal Vertex Cover problem is a dynamic variant of the vertex cover problem. We have a two player game in which guards are placed on some vertices of a graph. In every move, one player (the attacker) attack...

    Jasine Babu, Neeldhara Misra… in Computer Science – Theory and Applications (2022)

  3. No Access

    Chapter and Conference Paper

    An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter

    An orientation of an undirected graph G is an assignment of exactly one direction to each edge of G. The oriented diameter of a graph G is the smallest diameter among all the orientations of G. The maximum orient...

    Jasine Babu, Deepu Benson… in Computer Science – Theory and Applications (2020)

  4. No Access

    Chapter and Conference Paper

    A New Lower Bound for the Eternal Vertex Cover Number of Graphs

    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...

    Jasine Babu, Veena Prabhakaran in Computing and Combinatorics (2020)