A note on eigenvalue bounds for independence numbers of non-regular graphs

[1]  Michael Doob,et al.  Spectra of graphs , 1980 .

[2]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[3]  Herbert S. Wilf,et al.  Spectral bounds for the clique and independence numbers of graphs , 1986, J. Comb. Theory, Ser. B.

[4]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[5]  Fan Chung Graham,et al.  Quasi-random graphs , 1988, Comb..

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  W. Haemers.  Interlacing eigenvalues and graphs , 1995 .

[8]  Noga Alon,et al.  Norm-Graphs: Variations and Applications , 1999, J. Comb. Theory, Ser. B.

[9]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[10]  M. Aigner,et al.  Proofs from "The Book" , 2001 .

[11]  Tibor Szabó.  On the spectrum of projective norm-graphs , 2003, Inf. Process. Lett..

[12]  Dragan Stevanovic,et al.  The largest eigenvalue of nonregular graphs , 2004, J. Comb. Theory, Ser. B.

[13]  Xiaodong Zhang.  Eigenvectors and eigenvalues of non-regular graphs , 2005 .

[14]  Jason S. Williford,et al.  On the independence number of the Erdos-Rényi and projective norm graphs and a related hypergraph , 2007 .

[15]  Sebastian M. Cioaba,et al.  Extreme eigenvalues of nonregular graphs , 2007, J. Comb. Theory, Ser. B.

[16]  Chris D. Godsil,et al.  Eigenvalue bounds for independent sets , 2008, J. Comb. Theory, Ser. B.