满足n=2γ的树的特征值

  • 冯立华
展开
  • 山东工商学院,数学学院,山东,烟台264005;上海交通大学,数学系,上海200240

网络出版日期: 2009-05-25

基金资助

国家自然科学基金,山东省教育厅资助项目,山东省自然科学基金

Eigenvalues of Trees Satisfying n=2γ

  • FENG Li-hua
Expand

Online published: 2009-05-25

摘要

研究了满足n=2γ的树的特征值,包括它的Laplacian矩阵与邻接矩阵的最大特征值,并确定了极树.

关键词: 树; 谱; 控制数

本文引用格式

冯立华 . 满足n=2γ的树的特征值[J]. 河北大学学报(自然科学版), 2009 , 29(3) : 235 -237 . DOI: 10.3969/j.issn.1000-1565.2009.03.004

参考文献

[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.
文章导航

/

〈 〉