图的代数连通度的界(英文)  

Bounds on the Algebraic Connectivity of Graphs

作　　者：田贵贤[1,2] 黄廷祝[2] 崔淑玉[1,3] 

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004 [2]电子科技大学数学科学学院,四川成都611731 [3]浙江师范大学行知学院,浙江金华321004

出　　处：《数学进展》2012年第2期217-224,共8页Advances in Mathematics（China）

基　　金：Supported by the Education of Zhejiang Province(No.Y201120835);the Opening Fund of Top Key Discipline of Computer Software and Theory in Zhejiang Provincial Colleges at Zhejiang Normal University, Sichuan Province Sci.& Tech.Research Project(No.2009GZ0004,No.2009HH0025)

摘　　要：本文首先给出了简单图的度序列的平方和的上界,利用这些结果,求出了简单图的代数连通度的几个上下界并确定了它们的临界图。另外,文章也给出了加权图的代数连通度的一个下界。In this paper,we first give some upper bounds on the sum of the squares of the degrees in a simple graph.Using these results,we obtain some upper and lower bounds of algebraic connectivity of graphs and determine their extremal graphs.In addition,a lower bound of algebraic connectivity of a weighted graph is also presented.

关 键 词：图 加权图 LAPLACIAN矩阵 代数连通度 

分 类 号：O157.5[理学—数学]