Abstract:
In previous works an upper bound on the stability number of a graph based on quadratic programming was introduced and several of its properties were given. The graphs for which this bound is attained has been known as graphs with convex-QP stability number. This paper proposes a new upper bound on the stability number whose determination is also done by quadratic programming. It is proved that the new bound improves the above mentioned bound and several computational tests asserting its interest for large graphs are presented. In addition a necessary and sufficient condition for a graph to attain the new bound is proved. As a consequence a graph with convex-QP stability number also attains the new bound. On the other hand it is shown the existence of graphs attaining the new bound that do not belong to the class of graphs with convex-QP stability number. This allows to assert that the class of graphs with convex-QP stability number is strictly included in the class of graphs that attain the introduced bound. Some conclusions and lines for future work finalize the paper.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Alizadeh J.-P. Haeberly M.V. Nayakkankuppam M.L. Overton S. Schmieta (1997) SDPpack User’s Guide – Version 0.9 beta, Technical Report TR1997-737 Courant Institute of Mathematical Sciences NYU, New York.
Berge, C. (1991), Graphs, North-Holland, Amsterdam
I.M. Bomze (1998) ArticleTitleOn standard quadratic optimization problems Journal of Global Optimization 13 369–387 Occurrence Handle10.1023/A:1008369322970 Occurrence Handle1673454 Occurrence Handle0916.90214
Bomze, I.M., Budinich, M., Pardalos, P.M. and Pelillo, M. (1999), The maximum clique problem. In: Du D.Z. and Pardalos, P.M. (eds), Handbook of Combinatorial Optimization, Vol. A, pp. 1–74. Kluwer Academic Publishers.
D.M. Cardoso (2001) ArticleTitleConvex quadratic programming approach to the maximum matching problem Journal of Global Optimization 19 291–306 Occurrence Handle10.1023/A:1011276123981 Occurrence Handle1833221 Occurrence Handle0991.90100
Cvetkovic, D., Doob, M. and Sachs, H. (1979), Spectra of Graphs, Theory and Applications, VEB Deutscher Verlag der Wissenschaften, Berlin (DDR).
L.E. Gibbons D.W. Hearn P.M. Pardalos M.V. Ramana (1997) ArticleTitleContinuous characterizations of the maximum clique problem Mathematics of Operations Research 22 754–768 Occurrence Handle10.1287/moor.22.3.754 Occurrence Handle1467395 Occurrence Handle0883.90098
M.X. Goemans (1997) ArticleTitleSemidefinite programming in combinatorial optimization Mathematical Programming 79 143–161 Occurrence Handle1464765 Occurrence Handle0887.90139
M. Grötschel L. Lovász A. Schrijver (1988) Geometric Algorithms and Combinatorial Optimization Springer Berlin Occurrence Handle10.1007/978-3-642-97881-4 Occurrence Handle0634.05001
W.H. Haemers (1995) ArticleTitleInterlacing eigenvalues and graphs Linear Algebra and Its Applications 227 IssueID228 593–616 Occurrence Handle10.1016/0024-3795(95)00199-2 Occurrence Handle1344588
C. Helmberg (2000) Semidefinite Programming for Combinatorial Optimization Konrad-Zuse-Zentrum für Informationstechnik Berlin
Horn, R.A. and Johnson, C.R. (1985), Matrix Analysis, Cambridge University Press.
L. Lovász (1979) ArticleTitleOn the Shannon capacity of a graph IEEE Transactions on Information Theory 25 IssueID2 1–7 Occurrence Handle10.1109/TIT.1979.1055985 Occurrence Handle0395.94021
L. Lovász A. Schrijver (1991) ArticleTitleCones of matrices and set-functions and 0–1 optimization SIAM Journal on Optimization 1 IssueID2 166–190 Occurrence Handle10.1137/0801013 Occurrence Handle1098425 Occurrence Handle0754.90039
Lozin, V.V. and Cardoso, D.M. (1999), On Hereditary Properties of the Class of Graphs with Quadratic Stability Number, Cadernos de Matemática, CM/I-50, Math. Dep. of Aveiro University.
C.J. Luz (1995) ArticleTitleAn upper bound on the independence number of a graph computable in polynomial time Operations Research Letters 18 139–145 Occurrence Handle10.1016/0167-6377(95)00042-9 Occurrence Handle1365477 Occurrence Handle0855.90134
C.J. Luz D.M. Cardoso (1998) ArticleTitleA Generalization of the Hoffman-Lovász upper bound on the independence number of a Regular graph Annals of Operations Research 81 307–319 Occurrence Handle10.1023/A:1018965309522 Occurrence Handle1638402 Occurrence Handle0908.90260
C.J. Luz D.M. Cardoso (2001) ArticleTitleA quadratic programming approach to the determination of an upper bound on the weighted stability number European Journal of Operational Research 132 IssueID3 91–103 Occurrence Handle10.1016/S0377-2217(00)00162-4 Occurrence Handle1832516
T.S. Motzkin E.G. Straus (1965) ArticleTitleMaxima for graphs and a new proof of a theorem of Turán Canadian Journal of Mathematics 17 533–540 Occurrence Handle10.4153/CJM-1965-053-6 Occurrence Handle175813 Occurrence Handle0129.39902
A.L. Peressini F.E. Sullivan J.J. Uhl (1993) The Mathematics of Nonlinear Programming Springer Berlin
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Luz, C.J. Improving an Upper Bound on the Stability Number of a Graph. J Glob Optim 31, 61–84 (2005). https://doi.org/10.1007/s10898-004-6536-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-6536-4