论文信息 - Minimizing the least eigenvalue of graphs with fixed order and size - 字舞流文

Minimizing the least eigenvalue of graphs with fixed order and size

Charles R. Johnson | Aneta Sawikowska | Aneta Sawikowska

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

[2] G. Constantine. Lower bounds on the spectra of symmetric matrices with nonnegative entries , 1985 .

[3] N. Alon. Eigenvalues and expanders , 1986, Comb..

[4] D. L. Powers. Bounds on graph eigenvalues , 1989 .

[5] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .

[6] Odile Favaron,et al. Some eigenvalue properties in graphs (conjectures of Graffiti - II) , 1993, Discret. Math..

[7] D. Cvetkovic,et al. Eigenspaces of graphs: Bibliography , 1997 .

[8] Nicholas J. Higham,et al. Functions of matrices - theory and computation , 2008 .

[9] Shmuel Friedland,et al. On the First Eigenvalue of Bipartite Graphs , 2008, Electron. J. Comb..

[10] N. Higham. Functions Of Matrices , 2008 .

[11] D. Cvetkovic,et al. Graphs for which the least eigenvalue is minimal, II , 2008 .

[12] Charles R. Johnson,et al. Gangster operators and invincibility of positive semidefinite matrices , 2010 .

[13] Luca Trevisan,et al. Max cut and the smallest eigenvalue , 2008, STOC '09.