论文信息 - Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order

Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order

For every integer n≥4, it is proved that there is a unique graph of order n which maximizes the spectral radius of the unoriented Laplacian matrix over all bicyclic graphs of order n, namely, the graph obtained from the cycle C 4 by first adding a chord and then attaching n − 4 pendant edges to one end of the chord.

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

[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

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

[4] Devadatta M. Kulkarni,et al. Algebraic graph theory without orientation , 1994 .

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

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

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

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

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

[10] Edwin R. Hancock,et al. Eigenspaces for Graphs , 2002, Int. J. Image Graph..

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

[12] J. A. Bondy,et al. Graph Theory with Applications , 1978 .