给定团数的连通图的最小代数连通度

删除或更新信息，请邮件至freekaoyan#163.com(#换成@)

本站小编 Free考研考试/2021-12-27

给定团数的连通图的最小代数连通度李建喜¹, 郭继明², 邵慰慈³1. 闽南师范大学数学与统计学院, 漳州 363000;
2. 华东理工大学理学院, 上海 200237;
3. 香港浸会大学数学系, 香港, 九龙塘 The Minimum Algebraic Connectivity of Graphs with a Given Clique Number LI Jianxi¹, GUO Jiming², SHIU Wai Chee³1. School of Mathematics and Statistics, Minnan Normal University, Zhangzhou 363000, China;
2. Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China;
3. Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, China

摘要
图/表
参考文献(0)
相关文章(2)
点击分布统计
下载分布统计
-->

全文: PDF(331 KB) HTML (1 KB)
输出: BibTeX | EndNote (RIS)

摘要图G的拉普拉斯矩阵的第二小特征值称为图G的代数连通度.在给定团数ω的n阶连通图中，本文刻画了具有最小代数连通度的图为风筝图PK_n-ω，ω，其中风筝图PK_n-ω，ω是由完全图K_ω在某一点上引出一条悬挂路P_n-ω而得到的图.同时，对风筝图PK_n-ω，ω的代数连通度的一些性质也做了讨论.

服务

加入引用管理器

E-mail Alert

RSS

收稿日期: 2012-05-22

PACS:

0157.5

基金资助:国家自然科学基金（11471077，1379021，11371372），福建省自然科学基金（2014J01020，2015J01018，2016J01673）和中国博士后科学基金（2014M551831）资助项目.

引用本文:

李建喜, 郭继明, 邵慰慈. 给定团数的连通图的最小代数连通度[J]. 应用数学学报, 2016, 39(6): 928-937. LI Jianxi, GUO Jiming, SHIU Wai Chee. The Minimum Algebraic Connectivity of Graphs with a Given Clique Number. Acta Mathematicae Applicatae Sinica, 2016, 39(6): 928-937.

链接本文:

http://123.57.41.99/jweb_yysxxb/CN/或 http://123.57.41.99/jweb_yysxxb/CN/Y2016/V39/I6/928

[1]	Bondy J, Murty U. Graph theory with applications. New York: MacMillan, 1976
[2]	Fiedler M. Algebraic connectivity of graphs. Czech. Math. J., 1973, 23: 298-305
[3]	Merris R. Laplacian graph eigenvectors. Linear Algebra Appl., 1998, 278: 221-236
[4]	Godsil C, Royle G. Algebraic Graph Theory. GTM, Springer-Verlag, 2001
[5]	Fallat S, Kirkland S. Extremizing algebraic connectivity subject to graph theoretic constraints. Electron. J. Linear Algebra, 1998, 3: 48-74
[6]	Fallat S, Kirkland S, Pati S. Minimizing algebraic connectivity over conncted graphs with fixed girth. Discrete Math., 2002, 254: 115-142
[7]	Guo J M. A conjecture on the algebraic connectivity of connected graphs with fixed girth. Discrete Math., 2008, 308: 5702-5711
[8]	Guo J M, Shiu W C, Li J. The algebraic connectivity of lollipop graphs. Linear Algebra Appl., 2011, 434: 2204-2210
[9]	Li J, Guo J M, Shiu W C. The smallest values of algebraic connectivity for unicyclic graphs. Discrete Appl. Math., 2010, 158: 1633-1643
[10]	Li J, Guo J M, Shiu W C. The orderings of bicyclic graphs and connected graphs by algebraic connectivity. Electronic J. Comb., 2010, 17: #R162
[11]	Li J, Guo J M, Shiu W C. The smallest values of algebraic connectivity for trees. Acta Math. Sinica, 2012, 28: 2021-2032
[12]	Shao J Y, Guo J M, Shan H Y. The ordering of trees and connected graphs by their algebraic connectivity. Linear Algebra Appl., 2008, 428: 1421-1438
[13]	Shiu W C, Guo J M, Li J. The minimum algebraic connectivity of caterpillar unicyclic graphs. Electron. J. Linear Algebra, 2011, 22: 838-848
[14]	d e Abreu N. Old and new results on algebraic connctivity of graphs. Linear Algebra Appl., 2007, 423: 53-73
[15]	Guo J M. On the second largest Laplacian eigenvalue of trees. Linear Algebra Appl., 2005, 404: 251-261
[16]	Cvetkovi? D, Doob M, Sachs H. Spectra of Graphs. New York: Academic Press, 1980
[17]	Guo J M. The algebraic connectivity of graphs under perturbation. Linear Algebra Appl., 2010, 433: 1148-1153

[1]	管宇, 张晓东, 徐光辉. 树的变形与代数连通度[J]. 应用数学学报(英文版), 2011, 34(2): 341-352.
[2]	管宇, 张晓东, 徐光辉. 树的变形与代数连通度[J]. 应用数学学报(英文版), 2011, 34(1): 341-352.

PDF全文下载地址:

http://123.57.41.99/jweb_yysxxb/CN/article/downloadArticleFile.do?attachType=PDF&id=14225