{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:10Z","timestamp":1759063810835},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00386-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"535-543","source":"Crossref","is-referenced-by-count":30,"title":["Exact bounds on the order of the maximum clique of a graph"],"prefix":"10.1016","volume":"127","author":[{"given":"Marco","family":"Budinich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0166-218X(02)00386-4_BIB1","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1137\/0122052","article-title":"Upper bounds of the order of a clique of a graph","volume":"22","author":"Amin","year":"1972","journal-title":"SIAM J. Appl. Math"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008230200610","article-title":"Evolution towards the maximum clique","volume":"10","author":"Bomze","year":"1997","journal-title":"J. Global Optim"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB3","unstructured":"I.M. Bomze, personal communication."},{"key":"10.1016\/S0166-218X(02)00386-4_BIB4","unstructured":"E. Cartan, The Theory of Spinors, Hermann, Paris, 1966 (1st Edition, 1937, in French), p. 158."},{"key":"10.1016\/S0166-218X(02)00386-4_BIB5","doi-asserted-by":"crossref","unstructured":"F.R.K. Chung, Spectral graph theory, CBMS\u2014Regional Conference Series in Mathematics, American Mathematical Society, USA, 1997, pp. XII-208.","DOI":"10.1090\/cbms\/092"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB6","unstructured":"D.M. Cvetkovi\u0107, M. Doob, H. Sachs, Spectra of Graphs, Academic Press, New York, 1980, p. 368."},{"key":"10.1016\/S0166-218X(02)00386-4_BIB7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(83)90015-X","article-title":"Lower bounds for the clique and the chromatic numbers of a graph","volume":"5","author":"Edwards","year":"1983","journal-title":"Discrete Appl. Math"},{"issue":"3","key":"10.1016\/S0166-218X(02)00386-4_BIB8","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.22.3.754","article-title":"Continuous characterization of the maximum clique problem","volume":"22","author":"Gibbons","year":"1997","journal-title":"Math. Oper. Res"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB9","doi-asserted-by":"crossref","unstructured":"R.A. Horn, C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985\/1992, pp. xiv-562.","DOI":"10.1017\/CBO9780511810817"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB10","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, American Mathematical Society, Providence, RI, 1996 (see also http:\/\/dimacs.rutgers.edu\/Volumes\/Vo126.html).","DOI":"10.1090\/dimacs\/026\/01"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB11","unstructured":"F. Juh\u00e1sz, On the spectrum of a random graph, Algebraic Methods in Graph Theory, Szeged (Hungary) 1978, Colloquia Mathematica J\u00e1nos Bolyai, 25, Vol. I, North-Holland Publishing Company, Amsterdam, Oxford, New York, pp. 313\u2013316."},{"key":"10.1016\/S0166-218X(02)00386-4_BIB12","doi-asserted-by":"crossref","unstructured":"D.E. Knuth, The sandwich theorem, Electron. J. Combin. 1(A1) (1994) 48pp., http:\/\/www2.combinatorics.org\/Volume_1\/volume1.html\\#A1.","DOI":"10.37236\/1193"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB13","doi-asserted-by":"crossref","unstructured":"B. Mohar, S. Poljak, Eigenvalues in combinatorial optimization, in: R. Brualdi, S. Friedland, V. Klee (Eds.), IMA Volumes in Mathematics and its Applications, Combinatorial and Graph-Theoretic Problems in Linear Algebra, Vol. 50, Springer, Berlin, 1993.","DOI":"10.1007\/978-1-4613-8354-3_5"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","article-title":"Maxima for graphs and a new proof of a theorem of Tur\u00e1n","volume":"17","author":"Motzkin","year":"1965","journal-title":"Canad. J. Math"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB15","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1215\/S0012-7094-60-02752-6","article-title":"Bounds for the maximal characteristic root of a non-negative irreducible matrix","volume":"27","author":"Ostrowski","year":"1960","journal-title":"Duke Math. J"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207169008803851","article-title":"A global optimization approach for solving the maximum clique problem","volume":"33","author":"Pardalos","year":"1990","journal-title":"Internat. J. Comput. Math"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","article-title":"The maximum Clique problem","volume":"4","author":"Pardalos","year":"1994","journal-title":"J. Global Optim"},{"issue":"4","key":"10.1016\/S0166-218X(02)00386-4_BIB18","first-page":"213","article-title":"Relaxation labeling networks for the maximum Clique Problem","volume":"2","author":"Pelillo","year":"1995","journal-title":"J. Artif. Neural Networks"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB19","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1112\/jlms\/s1-42.1.330","article-title":"The eigenvalues of a graph and its chromatic number","volume":"42","author":"Wilf","year":"1967","journal-title":"J. London Math. Soc"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0095-8956(86)90069-9","article-title":"Spectral bounds for the clique and independence numbers of graphs","volume":"40","author":"Wilf","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00386-4_BIB21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0024-3795(88)90183-8","article-title":"A bound on the spectral radius of graphs","volume":"108","author":"Yuan","year":"1988","journal-title":"Linear Algebra Appl"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003864?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003864?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T06:57:12Z","timestamp":1583996232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02003864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02003864"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00386-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}