IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v349y2025i3d10.1007_s10479-025-06571-2.html
   My bibliography  Save this article

Minimum-cardinality global defensive alliances in general graphs

Author

Listed:
  • André Rossi

    (Université Paris Dauphine - PSL)

  • Alok Singh

    (University of Hyderabad)

Abstract

A subset S of vertices of an undirected graph G is a defensive alliance if at least half of the vertices in the closed neighborhood of each vertex of S are in S. A defensive alliance is a global defensive alliance if it is also a dominating set of G. This paper addresses the problem of finding minimum-cardinality global defensive alliances for general graphs. Two integer linear programming formulations are proposed to address this problem, the second one being an improved version of the first one in which the constraints are attempted for tightening with a cubing-time algorithm. Two new lower bounds on the cardinality of a defensive global alliance are proposed: the first one is based on a linear time algorithm and is shown to be tighter than three of the four lower bounds from the literature, and the second one is derived from the linear programming relaxation of the aforementioned integer linear programming formulations of the problem. An upper bound on the global defensive alliance number is obtained using a greedy peeling algorithm that is shown to be at least as good as an upper bound of the literature, however it is also shown that the proposed algorithm may be unable to find an optimal solution for some graphs. Finally, numerical experiments are carried out on the 78 DIMACS instances and on 75 Erdős-Rényi graphs with up to 10,000 vertices in order to show the effectiveness of the proposed approaches.

Suggested Citation

  • André Rossi & Alok Singh, 2025. "Minimum-cardinality global defensive alliances in general graphs," Annals of Operations Research, Springer, vol. 349(3), pages 1891-1931, June.
    • Handle: RePEc:spr:annopr:v:349:y:2025:i:3:d:10.1007_s10479-025-06571-2
    DOI: 10.1007/s10479-025-06571-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06571-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-025-06571-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Ries, Bernard & Zenklusen, Rico, 2011. "A 2-approximation for the maximum satisfying bisection problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 169-175, April.
    2. Ryan Burdett & Michael Haythorpe, 2020. "An improved binary programming formulation for the secure domination problem," Annals of Operations Research, Springer, vol. 295(2), pages 561-573, December.
    3. Gerber, Michael U. & Kobler, Daniel, 2000. "Algorithmic approach to the satisfactory graph partitioning problem," European Journal of Operational Research, Elsevier, vol. 125(2), pages 283-291, September.
    4. Cioaba, S.M. & van Dam, E.R. & Koolen, J.H. & Lee, J.H., 2008. "A Lower Bound for the Spectral Radius of Graphs with Fixed Diameter," Discussion Paper 2008-75, Tilburg University, Center for Economic Research.
    5. Bazgan, Cristina & Tuza, Zsolt & Vanderpooten, Daniel, 2010. "Satisfactory graph partition, variants, and generalizations," European Journal of Operational Research, Elsevier, vol. 206(2), pages 271-280, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ries, Bernard & Zenklusen, Rico, 2011. "A 2-approximation for the maximum satisfying bisection problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 169-175, April.
    2. Bazgan, Cristina & Tuza, Zsolt & Vanderpooten, Daniel, 2010. "Satisfactory graph partition, variants, and generalizations," European Journal of Operational Research, Elsevier, vol. 206(2), pages 271-280, October.
    3. Raka Jovanovic & Tatsushi Nishi & Stefan Voß, 2017. "A heuristic approach for dividing graphs into bi-connected components with a size constraint," Journal of Heuristics, Springer, vol. 23(2), pages 111-136, June.
    4. Heditniemi, S.M. & Laskar, R.C. & Mulder, H.M., 2012. "Quorum Colorings of Graphs," Econometric Institute Research Papers EI 2012-20, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    5. Ryan Burdett & Michael Haythorpe & Alex Newcombe, 2023. "Binary programming formulations for the upper domination problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(2), pages 155-168, October.
    6. Valentin Bouquet & François Delbot & Christophe Picouleau, 2025. "Partition of graphs with maximum degree ratio," Annals of Operations Research, Springer, vol. 351(1), pages 563-574, August.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:349:y:2025:i:3:d:10.1007_s10479-025-06571-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.