Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues
暂无分享,去创建一个
Miriam Farber | Charles R. Johnson | Lee Kennedy-Shaffer | Zachary B. Charles | Zachary B. Charles | Miriam Farber | L. Kennedy-Shaffer
[1] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .
[2] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.
[3] E. Haynsworth. Determination of the inertia of a partitioned Hermitian matrix , 1968 .
[4] J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian , 1969 .
[5] M. Fiedler. Algebraic connectivity of graphs , 1973 .
[6] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[7] B. Mohar. THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .
[8] R. Merris. Laplacian matrices of graphs: a survey , 1994 .
[9] Brendan D. McKay,et al. R(4, 5) = 25 , 1995, J. Graph Theory.
[10] Changan. SOME PROPERTIES OF THE SPECTRUM OF GRAPHS , 1999 .
[11] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.
[12] R 4 , 2003 .
[13] W. Haemers,et al. A lower bound for the Laplacian eigenvalues of a graph—Proof of a conjecture by Guo , 2008 .
[14] S. Radziszowski. Small Ramsey Numbers , 2011 .
[15] Miriam Farber,et al. Nonpositive Eigenvalues of Hollow, Symmetric, Nonnegative Matrices , 2013, SIAM J. Matrix Anal. Appl..