Abstract
Eternal vertex cover problem is a variant of the vertex cover problem. It is a two player (attacker and defender) game in which given a graph \(G=(V,E)\), the defender needs to allocate guards at some vertices so that the allocated vertices form a vertex cover. Attacker can attack one edge at a time and the defender needs to move the guards along the edges such that at least one guard moves through the attacked edge and the new configuration still remains a vertex cover. The attacker wins if no such move exists for the defender. The defender wins if there exists a strategy to defend the graph against infinite sequence of attacks. The minimum number of guards with which the defender can form a winning strategy is called the eternal vertex cover number of G, and is denoted by evc(G). Given a graph G, the problem of finding the eternal vertex cover number is NP-hard for general graphs, and remains NP-hard even for bipartite graphs. We have given a polynomial time algorithm to find the Eternal vertex cover number in chain graphs and cographs. We have also given a linear-time algorithm to find the eternal vertex cover number for split graphs, an important subclass of chordal graphs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Araki, H., Fujito, T., Inoue, S.: On the eternal vertex cover numbers of generalized trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6), 1153–1160 (2015)
Babu, J., Chandran, L.S., Francis, M., Prabhakaran, V., Rajendraprasad, D., Warrier, N.J.: On graphs whose eternal vertex cover number and vertex cover number coincide. Discret. Appl. Math. 319, 171–182 (2022)
Babu, J., Misra, N., Nanoti, S.G.: Eternal vertex cover on bipartite graphs. In: Kulikov, A.S., Raskhodnikova, S. (eds.) Computer Science–Theory and Applications. CSR 2022. LNCS, vol. 13296, pp. 64–76. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-09574-0_5
Babu, J., Prabhakaran, V.: A new lower bound for the eternal vertex cover number of graphs. J. Comb. Optim. 06, 2482–2498 (2021)
Babu, J., Prabhakaran, V., Sharma, A.: A substructure based lower bound for eternal vertex cover number. Theor. Comput. Sci. 890, 87–104 (2021)
Fomin, F.V., Gaspers, S., Golovach, P.A., Kratsch, D., Saurabh, S.: Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110(16), 702–706 (2010)
Hayward, R.B., Spinrad, J., Sritharan, R.: Weakly chordal graph algorithms via handles. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 9–11 January 2000, San Francisco, CA, USA, pp. 42–49. ACM/SIAM (2000)
Klostermeyer, W.F., Mynhardt, C.M.: Edge protection in graphs. Australas. J. Comb. 45, 235–250 (2009)
McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discret. Math. 201(1–3), 189–241 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Paul, K., Pandey, A. (2023). Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. In: Lin, CC., Lin, B.M.T., Liotta, G. (eds) WALCOM: Algorithms and Computation. WALCOM 2023. Lecture Notes in Computer Science, vol 13973. Springer, Cham. https://doi.org/10.1007/978-3-031-27051-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-031-27051-2_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-27050-5
Online ISBN: 978-3-031-27051-2
eBook Packages: Computer ScienceComputer Science (R0)