首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图的代数连通度的界(英文)
引用本文:田贵贤,黄廷祝,崔淑玉.图的代数连通度的界(英文)[J].数学进展,2012(2):217-224.
作者姓名:田贵贤  黄廷祝  崔淑玉
作者单位:浙江师范大学数理与信息工程学院;电子科技大学数学科学学院;浙江师范大学行知学院
基金项目: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)
摘    要:本文首先给出了简单图的度序列的平方和的上界,利用这些结果,求出了简单图的代数连通度的几个上下界并确定了它们的临界图。另外,文章也给出了加权图的代数连通度的一个下界。

关 键 词:  加权图  Laplacian矩阵  代数连通度

Bounds on the Algebraic Connectivity of Graphs
TIAN Guixian,HUANG Tingzhu,CUI Shuyu.Bounds on the Algebraic Connectivity of Graphs[J].Advances in Mathematics,2012(2):217-224.
Authors:TIAN Guixian  HUANG Tingzhu  CUI Shuyu
Institution:1,3) (1.College of Mathematics,Physics and Information Engineering,Zhejiang Normal University, Jinhua,Zhejiang,321004,P.R.China;2.School of Mathematical Sciences,University of Electronic Science and Technology of China,Chengdu,Sichuan,611731,P.R.China;3.Xingzhi College,Zhejiang Normal University,Jinhua,Zhejiang,321004,P.R.China)
Abstract: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.
Keywords:graph  weighted graph  Laplacian matrix  algebraic connectivity
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号