Some eigenvalue properties in graphs (conjectures of Graffiti — II)

Bondy, 1971, Large cycles in graphs, Discrete Math., 1, 121, 10.1016/0012-365X(71)90019-7

Cvetkovič, 1988

Cvetkovič, 1979

Edwards, 1983, Lower bounds for the clique and the chromatic number of a graph, Discrete Appl. Math., 5, 51, 10.1016/0166-218X(83)90015-X

Fajtlowicz, 1987, On conjectures of Graffiti, II, Congr. Numer., 60, 187

S. Fajtlowicz, Written on the wall, a list of conjectures of Graffiti, University of Houston, USA.

Favaron, 1991, On the residue of a graph, J. Graph Theory, 15, 39, 10.1002/jgt.3190150107

O. Favaron, M. Mahéo and J.F. Saclé, L.R.I. Report number 577, Université Paris-Sud.

Finck, 1965, Vollständinges Produkt, 11, 1

Haemers, 1980

Hoffman, 1970, On eigenvalues and colourings of graphs, 79

Mohar, 1991, The Laplacian spectrum of graphs, 871

Nosal, 1970, Eigenvalues of graphs

Powers, 1988, Graph partitioning by eigenvectors, Linear Algebra and its Applications, 101, 121, 10.1016/0024-3795(88)90147-4

Powers, 1989, Bounds on graph eigenvalues, Linear Algebra and its Applications, 117, 1, 10.1016/0024-3795(89)90541-7

Weyl, 1912, Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen, Math. Ann., 71, 441, 10.1007/BF01456804

Wilkinson, 1965

Wilf, 1967, The eigenvalues of a graph and its chromatic number, J. London Math. Soc., 42, 330, 10.1112/jlms/s1-42.1.330