计算机工程与应用2017，Vol.53Issue(3)：106-109,163,5.DOI:10.3778/j.issn.1002-8331.1504-0259
基于网络拓扑图的树的代数连通度
Algebraic connectivity of trees based on network topology
摘要
Abstract
Algebraic graph theory methods play an important role in the network design. Spectrum of Laplacian matrix is associated with the synchronous ability of network. The algebraic connectivity is a depict important parameter of synchronous ability. In this paper, using a grafting method, it discusses the relationship between algebraic connectivity and diameter of a tree. For a special class of trees, the algebraic connectivity of the tree with a fixed number of vertices, is decreasing along with the increase of diameter. Moreover, using the Cauchy-Schwarz inequality as a guide, it also obtains bounds for the algebraic connectivity of a tree.关键词
树/拉普拉斯矩阵/代数连通度/直径Key words
tree/Laplace matrix/algebraic connectivity/diameter分类
数理科学引用本文复制引用
周后卿,徐幼专..基于网络拓扑图的树的代数连通度[J].计算机工程与应用,2017,53(3):106-109,163,5.基金项目
湖南省教育厅科学研究项目(No.15C1235,No.16C1434) （No.15C1235,No.16C1434）
邵阳市科技局科技计划项目(No.2015JH41). （No.2015JH41）
