Finding Smooth Graphs with Small Independence Numbers

  • Benedikt KlockerEmail author
  • Herbert Fleischner
  • Günther R. Raidl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10710)


In this paper we formulate an algorithm for finding smooth graphs with small independence numbers. To this end we formalize a family of satisfaction problems and propose a branch-and-bound-based approach for solving them. Strong bounds are obtained by exploiting graph-theoretic aspects including new results obtained in cooperation with leading graph theorists. Based on a partial solution we derive a lower bound by computing an independent set on a partial graph and finding a lower bound on the size of possible extensions.

The algorithm is used to test conjectured lower bounds on the independence numbers of smooth graphs and some subclasses of smooth graphs. In particular for the whole class of smooth graphs we test the lower bound of 2n/7 for all smooth graphs with at least \(n \ge 12\) vertices and can proof the correctness for all \(12 \le n \le 24\). Furthermore, we apply the algorithm on different subclasses, such as all triangle free smooth graphs.


Branch and bound Smooth graphs Combinatorial optimization 


  1. 1.
    Brooks, R.L.: On colouring the nodes of a network. Mathematical Proceedings of the Cambridge Philosophical Society 37, 194–197 (1941)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3-and 4-regular Hamiltonian graphs. Discrete Math. 310(20), 2742–2749 (2010)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Fleischner, H., Sarvanov, V.I.: Small maximum independent sets in Hamiltonian four-regular graphs. Rep. Nat. Acad. Sci. Belarus 57(1), 10 (2013)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Fleischner, H., Stiebitz, M.: A solution to a colouring problem of P. Erdős. Discrete Math. 101(1–3), 39–48 (1992)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Fleischner, H.: Institute of Computer Graphics and Algorithms. TU Wien, Personal communication (2016)Google Scholar
  6. 6.
    Griggs, J.R.: Lower bounds on the independence number in terms of the degrees. J. Comb. Theor. Ser. B 34(1), 22–39 (1983)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Gurobi Optimization Inc: Gurobi optimizer reference manual, version 7.0.1 (2016)Google Scholar
  8. 8.
    Halldórsson, M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18(1), 145–163 (1997)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Jones, K.F.: Independence in graphs with maximum degree four. J. Comb. Theor. Ser. B 37(3), 254–269 (1984)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699–719 (1966)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Sarvanov, V.I.: Institute of Mathematics at the National Academy of Sciences of Belarus. Personal communication (2016)Google Scholar
  12. 12.
    Shearer, J.B.: A note on the independence number of triangle-free graphs. Discrete Math. 46(1), 83–87 (1983)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Benedikt Klocker
    • 1
    Email author
  • Herbert Fleischner
    • 1
  • Günther R. Raidl
    • 1
  1. 1.Institute of Computer Graphics and AlgorithmsTU WienViennaAustria

Personalised recommendations