Exact bounds on the order of the maximum clique of a graph

Discrete Applied Mathematics

Volumn 127, Issue 3, 2003, Pages 535-543

  Budinich, Marco ^a  

^a UNIVERSITY OF TRIESTE   (Italy)

Author keywords

Bound; Graph; Maximum clique

Indexed keywords

COMBINATORIAL MATHEMATICS;

ADJACENCY MATRICES; BOUND; COMPLEX SPACE; GRAPH; LOWER BOUNDS; MAXIMUM CLIQUE; MAXIMUM CLIQUE PROBLEMS; RANDOM GRAPHS;

MATHEMATICAL TECHNIQUES;

EID: 84867960210     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00386-4     Document Type: Article

References (21)

1. A.T. Amin, and S.L. Hakimi Upper bounds of the order of a clique of a graph SIAM J. Appl. Math 22 4 1972 569 573
2. I.M. Bomze Evolution towards the maximum clique J. Global Optim 10 1997 143 164
3. I.M. Bomze, personal communication.
4. E. Cartan, The Theory of Spinors, Hermann, Paris, 1966 (1st Edition, 1937, in French), p. 158.
5. F.R.K. Chung, Spectral graph theory, CBMS - Regional Conference Series in Mathematics, American Mathematical Society, USA, 1997, pp. XII-208.
6. D.M. Cvetković, M. Doob, H. Sachs, Spectra of Graphs, Academic Press, New York, 1980, p. 368.
7. C.S. Edwards, and C.H. Elphick Lower bounds for the clique and the chromatic numbers of a graph Discrete Appl. Math 5 1983 51 64
8. L.E. Gibbons, D.W. Hearn, P.M. Pardalos, and M.W. Ramana Continuous characterization of the maximum clique problem Math. Oper. Res 22 3 1997 754 768
9. R.A. Horn, C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985/1992, pp. xiv-562.
10. 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).
11. F. Juhász, On the spectrum of a random graph, Algebraic Methods in Graph Theory, Szeged (Hungary) 1978, Colloquia Mathematica János Bolyai, 25, Vol. I, North-Holland Publishing Company, Amsterdam, Oxford, New York, pp. 313-316.
12. D.E. Knuth, The sandwich theorem, Electron. J. Combin. 1(A1) (1994) 48pp., http://www2.combinatorics.org/Volume-1/volume1.html\#A1.
13. 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.
14. T.S. Motzkin, and E.G. Straus Maxima for graphs and a new proof of a theorem of Turán Canad. J. Math 17 1965 533 540
15. A. Ostrowski, and H. Schneider Bounds for the maximal characteristic root of a non-negative irreducible matrix Duke Math. J 27 1960 547 553
16. P.M. Pardalos, and A.T. Philips A global optimization approach for solving the maximum clique problem Internat. J. Comput. Math 33 1990 209 216
17. P.M. Pardalos, and J. Xue The maximum Clique problem J. Global Optim 4 1994 301 328
18. M. Pelillo Relaxation labeling networks for the maximum Clique Problem J. Artif. Neural Networks 2 4 1995 213 227
19. H.S. Wilf The eigenvalues of a graph and its chromatic number J. London Math. Soc 42 1967 330 332
20. H.S. Wilf Spectral bounds for the clique and independence numbers of graphs J. Combin. Theory Ser. B 40 1986 113 117
21. H. Yuan A bound on the spectral radius of graphs Linear Algebra Appl 108 1988 135 139