Skip to main content
SpringerLink
Log in

Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14508))

Included in the following conference series:

  • 121 Accesses

Abstract

A variation of the vertex cover problem is the eternal vertex cover problem. This is a two-player (attacker and defender) game, where the defender must allocate guards at specific vertices in order for those vertices to form a vertex cover. The attacker can attack one edge at a time. The defender must move the guards along the edges so that at least one guard passes through the attacked edge (guard moves from one end point of the attacked edge to the another end point), and the new configuration still acts as a vertex cover. If the defender is unable to make such a maneuver, the attacker prevails. If a strategy for defending the graph against any infinite series of attacks emerges, the defender wins. The eternal vertex cover problem is to find the smallest number of guards with which the defender can develop a successful strategy. The same problem is referred as the eternal connected vertex cover problem if the following additional requirement is added: underlying vertices of each defensive configuration form a connected vertex cover. The smallest number of guards that can be used to create a successful defensive strategy, in this case, is known as the eternal connected vertex cover number and is denoted by the ecvc(G). The decision version of the eternal connected vertex cover problem is NP-hard for general graphs and it also remains NP-hard for bipartite graphs. In this paper, we proved that the problem is polynomial-time solvable for chain graphs and cographs. In addition, we proved that the problem is NP-hard for Hamiltonian graphs, and proposed a polynomial-time algorithm to compute eternal connected vertex cover number for Mycielskian of a given Hamiltonian graph.

A. Pandey—Research supported by CRG project, Grant Number-CRG/2022/008333, Science and Engineering Research Board (SERB), India.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Araki, H., Fujito, T., Inoue, S.: On the eternal vertex cover numbers of generalized trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98, 1153–1160 (2015)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Babu, J., Misra, N., Nanoti, S.G.: Eternal vertex cover on bipartite graphs. In: Kulikov, A.S., Raskhodnikova, S. (eds.) CSR 2022. LNCS, vol. 13296, pp. 64–76. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-09574-0_5

    Chapter  Google Scholar 

  4. Babu, J., Prabhakaran, V.: A new lower bound for the eternal vertex cover number of graphs. J. Comb. Optim. 44, 2482–2498 (2022)

    Article  MathSciNet  Google Scholar 

  5. Babu, J., Prabhakaran, V., Sharma, A.: A substructure based lower bound for eternal vertex cover number. Theor. Comput. Sci. 890, 87–104 (2021)

    Article  MathSciNet  Google Scholar 

  6. Escoffier, B., Gourvès, L., Monnot, J.: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8, 36–49 (2010)

    Article  MathSciNet  Google Scholar 

  7. Fernau, H., Manlove, D.F.: Vertex and edge covers with clustering properties: complexity and algorithms. J. Discrete Algorithms 7, 149–167 (2009)

    Article  MathSciNet  Google Scholar 

  8. Fisher, D.C., McKenna, P.A., Boyer, E.D.: Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski’s graphs. Discret. Appl. Math. 84, 93–105 (1998)

    Article  MathSciNet  Google Scholar 

  9. Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3- and 4-regular Hamiltonian graphs. Discret. Math. 310, 2742–2749 (2010)

    Article  MathSciNet  Google Scholar 

  10. Fomin, F.V., Gaspers, S., Golovach, P.A., Kratsch, D., Saurabh, S.: Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110, 702–706 (2010)

    Article  MathSciNet  Google Scholar 

  11. Fujito, T., Nakamura, T.: Eternal connected vertex cover problem. In: Chen, J., Feng, Q., Xu, J. (eds.) TAMC 2020. LNCS, vol. 12337, pp. 181–192. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59267-7_16

    Chapter  Google Scholar 

  12. Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is \$np\$-complete. SIAM J. Appl. Math. 32, 826–834 (1977)

    Article  MathSciNet  Google Scholar 

  13. Hammer, P.L., Maffray, F.: Completely separable graphs. Discret. Appl. Math. 27, 85–99 (1990)

    Article  MathSciNet  Google Scholar 

  14. Klostermeyer, W.F., Mynhardt, C.M.: Edge protection in graphs. Australas. J Comb. 45, 235–250 (2009)

    MathSciNet  Google Scholar 

  15. Li, Y., Wang, W., Yang, Z.: The connected vertex cover problem in k-regular graphs. J. Comb. Optim. 38, 635–645 (2019)

    Article  MathSciNet  Google Scholar 

  16. Paul, K., Pandey, A.: Some algorithmic results for eternal vertex cover problem in graphs. In: Lin, C.C., Lin, B.M.T., Liotta, G. (eds.) WALCOM 2023. LNCS, vol. 13973, pp. 242–253. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-27051-2_21

    Chapter  Google Scholar 

  17. Priyadarsini, P.K., Hemalatha, T.: Connected vertex cover in 2-connected planar graph with maximum degree 4 is NP-complete. Int. J. Math. Comput. Phys. Electr. Comput. Eng, 1, 570–573 (2007)

    Google Scholar 

  18. Stewart, L.: Cographs: a Class of Tree Representable Graphs. University of Toronto, Department of Computer Science (1978)

    Google Scholar 

  19. Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discret. Math. 72, 355–360 (1988)

    Article  MathSciNet  Google Scholar 

  20. Watanabe, T., Kajita, S., Onaga, K.: Vertex covers and connected vertex covers in 3-connected graphs. In: 1991 IEEE International Symposium on Circuits and Systems (ISCAS), vol. 2, pp. 1017–1020 (1991)

    Google Scholar 

Download references

Acknowledgements

The authors would like to thank Prof. Ton Kloks for their invaluable inputs and suggestions which helped in improving the paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Ropar, Nangal Road, Rupnagar, 140001, Punjab, India

    Kaustav Paul & Arti Pandey

Authors
  1. Kaustav Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arti Pandey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Kaustav Paul or Arti Pandey .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Hyderabad, Sangareddy, India

    Subrahmanyam Kalyanasundaram

  2. Carleton University, Ottawa, ON, Canada

    Anil Maheshwari

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Paul, K., Pandey, A. (2024). Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms. In: Kalyanasundaram, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2024. Lecture Notes in Computer Science, vol 14508. Springer, Cham. https://doi.org/10.1007/978-3-031-52213-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-52213-0_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-52212-3

  • Online ISBN: 978-3-031-52213-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation