Journal of Combinatorial Optimization

, Volume 35, Issue 4, pp 1009–1041 | Cite as

Integer programming approach to static monopolies in graphs



A subset M of vertices of a graph is called a static monopoly, if any vertex v outside M has at least \(\lceil \tfrac{1 }{2}\deg (v)\rceil \) neighbors in M. The minimum static monopoly problem has been extensively studied in graph theoretical context. We study this problem from an integer programming point of view for the first time and give a linear formulation for it. We study the facial structure of the corresponding polytope, classify facet defining inequalities of the integer programming formulation and introduce some families of valid inequalities. We show that in the presence of a vertex cut or an edge cut in the graph, the problem can be solved more efficiently by adding some strong valid inequalities. An algorithm is given that solves the minimum monopoly problem in trees and cactus graphs in linear time. We test our methods by performing several experiments on randomly generated graphs. A software package is introduced that solves the minimum monopoly problem using open source integer linear programming solvers.


Static monopoly Integer programming Polytopes Valid inequalities Cactus graphs Majority thresholds 

Mathematics Subject Classification

05C69 05C85 90C10 90C57 



The authors are thankful for insightful comments from the anonymous referee that helped to improve the presentation of the results.


  1. Ackerman E, Ben-Zwi O, Wolfovitz G (2010) Combinatorial model and bounds for target set selection. Theor Comput Sci 411(44–46):4017–4022. MathSciNetCrossRefMATHGoogle Scholar
  2. Balas E, Ng SM (1989a) On the set covering polytope. I. All the facets with coefficients in \(\{0,1,2\}\). Math Program 43((1, (Ser. A))):57–69. MathSciNetCrossRefMATHGoogle Scholar
  3. Balas E, Ng SM (1989b) On the set covering polytope. II. Lifting the facets with coefficients in \(\{0,1,2\}\). Math Program 45((1, (Ser. B))):1–20. MathSciNetCrossRefMATHGoogle Scholar
  4. Bondy JA, Murty USR (2008) Graph theory. Graduate texts in mathematics. Springer, New York. MATHGoogle Scholar
  5. Cicalese F, Cordasco G, Gargano L, Milanič M, Peters J, Vaccaro U (2015) Spread of influence in weighted networks under time and budget constraints. Theor Comput Sci 586:40–58. MathSciNetCrossRefMATHGoogle Scholar
  6. Cornuéjols G, Sassano A (1989) On the 0,1 facets of the set covering polytope. Math Program 43((1, (Ser. A))):45–55. MathSciNetCrossRefMATHGoogle Scholar
  7. Erdös P, Rényi A (1959) On random graphs. I. Publ Math Debr 6:290–297MATHGoogle Scholar
  8. Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Monographs and textbooks in pure and applied mathematics, vol 208. Marcel Dekker Inc, New YorkGoogle Scholar
  9. Hedetniemi ST, Laskar R, Pfaff J (1986) A linear algorithm for finding a minimum dominating set in a cactus. Discrete Appl Math 13(2–3):287–292. MathSciNetCrossRefMATHGoogle Scholar
  10. Kempe D, Kleinberg J, Tardos E (2015) Maximizing the spread of influence through a social network. Theory Comput 11:105–147. MathSciNetCrossRefMATHGoogle Scholar
  11. Khoshkhah K, Soltani H, Zaker M (2012) On dynamic monopolies of graphs: the average and strict majority thresholds. Discrete Optim 9(2):77–83,,
  12. Khoshkhah K, Nemati M, Soltani H, Zaker M (2013) A study of monopolies in graphs. Graphs Comb 29(5):1417–1427. MathSciNetCrossRefMATHGoogle Scholar
  13. Korneyenko NM (1994) Combinatorial algorithms on a class of graphs. Discrete Appl Math 54(2–3):215–217. MathSciNetCrossRefMATHGoogle Scholar
  14. Lovász L, Schrijver A (1991) Cones of matrices and set-functions and 0-1 optimization. SIAM J Optim 1(2):166–190. MathSciNetCrossRefMATHGoogle Scholar
  15. Markov M, Andreica MI, Manev K, Ţăpuş N (2012) A linear time algorithm for computing longest paths in cactus graphs. Serdica J Comput 6(3):287–298MathSciNetMATHGoogle Scholar
  16. Nemhauser G, Wolsey L (1999) Integer and combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York, reprint of the 1988 original, A Wiley-Interscience PublicationGoogle Scholar
  17. Sánchez-Garcí a M, Sobrón MI, Vitoriano B (1998) On the set covering polytope: facets with coefficients in \(\{0,1,2,3\}\). Ann Oper Res 81:343–356,, applied mathematical programming and modeling, III (APMOD95) (Uxbridge)
  18. Sassano A (1989) On the facial structure of the set covering polytope. Math Program 44((2, (Ser. A))):181–202. MathSciNetCrossRefMATHGoogle Scholar
  19. Sigarreta JM, Rodríguez JA (2009) On the global offensive alliance number of a graph. Discrete Appl Math 157(2):219–226. MathSciNetCrossRefMATHGoogle Scholar
  20. Soltani H, Zaker M (2014) Partial vertex cover and the complexity of some monopoly problems. to appear in Utilitas MathematicaGoogle Scholar
  21. Zaker M (2012) On dynamic monopolies of graphs with general thresholds. Discrete Math 312(6):1136–1143. MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsKennesaw State UniversityKennesawUSA
  2. 2.Department of MathematicsUrmia University of TechnologyUrmiaIran

Personalised recommendations