论文信息 - On the second largest eigenvalue of a mixed graph

On the second largest eigenvalue of a mixed graph

Let G be a mixed graph. We discuss the relation between the second largest eigenvalue ‚2(G) and the second largest degree d2(G), and present a su‐cient condition for ‚2(G) ‚ d2(G).

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

[2] Xiaodong Zhang,et al. The Laplacian spectrum of a mixed graph , 2002 .

[3] Yi-Zheng Fan,et al. On the least eigenvalue of a unicyclic mixed graph , 2005 .

[4] Xiao-Dong Zhang,et al. The Laplacian eigenvalues of mixed graphs , 2003 .

[5] Russell Merris,et al. The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..

[6] Yong-Liang Pan,et al. A note on the second largest eigenvalue of the laplacian matrix of a graph , 2000 .

[7] R. Bapat,et al. Generalized matrix tree theorem for mixed graphs , 1999 .

[8] R. Merris. Laplacian matrices of graphs: a survey , 1994 .

[9] Yaoping Hou,et al. On the Laplacian Eigenvalues of Signed Graphs , 2003 .

[10] Jerrold W. Grossman,et al. Edge version of the matrix tree theorem for trees , 2000 .

[11] Yi-Zheng Fan. Largest eigenvalue of a unicyclic mixed graph , 2004 .

[12] M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[13] M. Fiedler. Algebraic connectivity of graphs , 1973 .

[14] Guo Ji Ming,et al. A relation between the matching number and Laplacian spectrum of a graph , 2001 .

[15] Yi-Zheng Fan,et al. On spectral integral variations of mixed graphs , 2003 .