研究了满足n=2γ的树的特征值,包括它的Laplacian矩阵与邻接矩阵的最大特征值,并确定了极树.
[1] CVETKOVIC D M, DOOB M, SACHS H. Spectra of graphs [M]. New York:Academic Press, Inc 1980.
[2] MOHAR B. The Laplacian spectrum of graphs [A]. New York:John Wiley & Sons 1991.
[3] MOHAR B. Some applications of Laplace eigenvalues of graphs [A]. Dordrecht:Kluwer Academic Publischer 1997.
[4] BONDY J A, MURTY U S R. Graph theory with applications [M]. North Holland, New York 1976.
[5] HAYNES T W, HEDONISM S T, SLATER P J. Fundamentals of domination in graphs [M]. New York:Marcel Deckker 1998.
[6] Pan YL.. Sharp upper bounds for the Laplacian graph eigenvalues [J]. Linear Algebra and its Applications 2002, 0(0).
[7] ZHANG Xiaodong, LUO Rong. The spectral radius of triangle-free graphs [J]. Australas J Combin 2002, 26.
[8] Merris R.. A note on Laplacian graph eigenvalues [J]. Linear Algebra and its Applications 1998, 1/3(1/3).
[9] HORN R A, JOHNSON C R. Matrix analysis [M]. New York:Cambridge University Press 1985.