Abstract
Given a simple, undirected graph G, Budinich (Discret Appl Math 127:535–543, 2003) proposed a lower bound on the clique number of G by combining the quadratic programming formulation of the clique number due to Motzkin and Straus (Can J Math 17:533–540, 1965) with the spectral decomposition of the adjacency matrix of G. This lower bound improves the previously known spectral lower bounds on the clique number that rely on the Motzkin–Straus formulation. In this paper, we give a simpler, alternative characterization of this lower bound. For regular graphs, this simpler characterization allows us to obtain a simple, closed-form expression of this lower bound as a function of the positive eigenvalues of the adjacency matrix. Our computational results shed light on the quality of this lower bound in comparison with the other spectral lower bounds on the clique number.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bomze IM (1997) Evolution towards the maximum clique. J Glob Optim 10: 143–164
Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization (supplement volume A). Kluwer, Boston, pp 1–74
Budinich M (2003) Exact bounds on the order of the maximum clique of a graph. Discret Appl Math 127: 535–543
Cvetković DM, Doob M, Sachs H (1979) Spectra of graphs. Pure and applied mathematics. Academic Press, New York
Godsil CD, Newman MW (2008) Eigenvalue bounds for independent sets. J Comb Theory Ser B 98: 721–734
Grötschel M, Lovász L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, New York
Hastad J (1999) Clique is hard to approximate within \({n^{1-\epsilon}}\) . Acta Math 182(1): 105–142
Lu M, Liu H, Tian F (2007) Laplacian spectral bounds for clique and independence numbers of graphs. J Comb Theory Ser B 97: 726–732
Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Turán. Can J Math 17: 533–540
Nikiforov V (2006) The smallest eigenvalue of K r -free graphs. Discret Math 306: 612–616
Nikiforov V (2009) More spectral bounds on the clique and independence numbers. J Comb Theory Ser B. doi:10.1016/j.jctb.2009.01.003
Wilf HS (1986) Spectral bounds for the clique and independence numbers of graphs. J Comb Theory Ser B 40: 113–117
Yıldırım EA, Fan-Orzechowski X (2006) On extracting maximum stable sets in perfect graphs using Lovász’s theta function. Comput Optim Appl 33(2–3): 229–247
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported in part by TÜBİTAK (Turkish Scientific and Technological Research Council) through Grant 109M149.
Rights and permissions
About this article
Cite this article
Yıldırım, E.A. A simpler characterization of a spectral lower bound on the clique number. Math Meth Oper Res 71, 267–281 (2010). https://doi.org/10.1007/s00186-009-0295-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-009-0295-4