给定控制数的树的代数连通度的上界

Upper Bounds on the Algebraic Connectivity of Trees with Given Domination Number

下载PDF

导出

摘要讨论了给定控制数的树的代数连通度的上界,并对极图给出了刻画. This paper presents a sharp upper bounds on the algebraic connectivity of trees with given domination number.

作者冯立华

机构地区山东工商学院数学学院

出处《吉首大学学报（自然科学版）》 CAS 2008年第2期5-6,共2页 Journal of Jishou University(Natural Sciences Edition)

基金国家自然科学基金资助项目(10531070) 山东省教育厅科学研究项目(J07YH03)

关键词树控制数代数连通度 tree domination number algebraic connectivity

参考文献7

1FIEDLER M. Algebraic Connectivity of Graphs [ J ]. Czechoslovake Math. J., 1973,23 (98) : 296 - 305.
2CVE1XOVIC D, DOOB M, SACHS H. Spectra of Graphs [ M ]. New York: Academic Press, 1980.
3BONDY J A, MURTY U S R. Graph Theory with Applications [ M ]. New York:Macmillan Press, 1976.
4GRONE R, MERRIS G. Ordering Trees by Algebraic Connectivity [ J]. Graphs Combin, 1990,6: 229 - 237.
5FALLAT S, KIRKLAND S. Extremizing the Algebraic Connectivity Subject to Graph Theoretic Constraints [J], Electron. J. Linear Algebra, 1998,3:48 - 74.
6MOLITIERNO J, NEUMANN M. On Trees with Perfect Matching [ J ]. Linear Algebraic Appl., 2003,326:75 - 85.
7DE ABREU N M M. Old and New Results on Algebraic Connectivity of Graphs [J]. Linear Algebra Appl. ,2007,423:53- 73.

吉首大学学报（自然科学版）

2008年第2期

内容加载中请稍等...