参考文献/References:
[ 1] Bondy J A, Murty U S R. G raph TheoryW ith App lica tions[M ] . New Yo rk: London and E lserv ier, 1976.
[ 2] No rm an B igg s. A lgebra ic Graph Theory [M ]. Cambr idge: Cambr idge Un iversity Press, 1993.
[ 3] H ofm eisterM. On the two largest e ig envalues of trees[ J]. Linear A lgebra and its Applications, 1997, 260: 43-59.
[ 4] 李乔, 冯克勤. 论图的最大特征根[ J]. 应用数学学报, 1979, 4( 2): 167-175.
[ 5] An Chang, Huang Q iongx iang. Order ing trees by the ir largest e igenva lues[ J]. L inear A lgebra and its App lications, 2003, 370: 175-184.
[ 6] Shao J Y. Bounds on theK th e ignevalue o f trees and forests[ J]. L inear A lgebra and its Applica tions, 1991, 149: 19-34.
[ 7] 梁修东. 树的最大特征值的序[ J]. 江南大学学报: 自然科学版, 2007, 12( 5): 627-630.
[ 8] Cvetkov ic D, DoobM, SachsH. Spectra of G raph-Theory and Application[M ]. New Yo rk: Academ ic Press, 1980.
[ 9] An Chang. On the largest e igenva lue of a treew ith perfect m atchings[ J] . D iscreteM athem atics, 2003, 269: 45-63.
相似文献/References:
[1]朱晓欣,孙志人,曹春正.连通图的拟拉普拉斯谱半径的一个上界[J].南京师大学报(自然科学版),2008,31(02):27.
Zhu Xiaoxin,Sun Zhiren,Cao Chunzheng.A Bound on Quasi-Laplacian Spectral Radius of Connected Graphs[J].Journal of Nanjing Normal University(Natural Science Edition),2008,31(04):27.
[2]黄滨,胡卫群.某类四阶微分方程带权特征值的算法[J].南京师大学报(自然科学版),2003,26(02):36.
Huang Bin,Hu Weiqun.One Computational Method of the Weighted Eigenvalues of a Class of Differential Equation with Four Orders[J].Journal of Nanjing Normal University(Natural Science Edition),2003,26(04):36.
[3]赵宇萍.估计对称阵特征值上下界的递推方法[J].南京师大学报(自然科学版),2001,24(01):16.
Zhao Yuping.A Recursive Algorithm of Estimating the Bounds of the Eigenvalues of a Symmetric Matrix[J].Journal of Nanjing Normal University(Natural Science Edition),2001,24(04):16.