Please wait a minute...
浙江大学学报（理学版）
浙江大学学报（理学版）  2018, Vol. 45 Issue (1): 10-13,17    DOI: 10.3785/j.issn.1008-9497.2018.01.002
数学与计算机科学     
卡氏积图的Laplacian谱半径的上界
周后卿
邵阳学院 理学院, 湖南 邵阳 422000
Upper bounds of Laplacian spectral radius for the Cartesian product graphs
ZHOU Houqing
College of Science, Shaoyang University, Shaoyang 422000, Hunan Province, China
 全文: PDF(1020 KB)   HTML  
摘要： 对近年来图的Laplacian谱半径上界的研究成果进行了简单梳理.利用2个图的卡氏积图的特征值，讨论了2个循环图的卡氏积图的Laplacian谱半径的上界问题，得到了几个上界，推广了已有文献的结论.
关键词： 卡氏积图;  Laplacian矩阵;  谱半径;  上界    
Abstract: We organize the results of the upper bounds of Laplacian spectral radius for some graphs in the last few years and explore the upper bounds of Laplacian spectral radius for the Cartesian product of circulant graphs based on the eigenvalues of the Cartesian product of two graphs. Our results generalize and improve the conclusion of the existing literatures.
Key words: Cartesian product graphs    Laplacian matrix    spectral radius    upper bound
收稿日期: 2016-07-25 出版日期: 2017-12-15
CLC:  O157.5  
基金资助: 国家自然科学基金资助项目（61672356）；湖南省教育厅科学研究项目（2015C1235，2016C1434）.
作者简介: 周后卿(1963-),ORCID:http://orcid.org/000-0002-9813-1687,男,硕士,教授,主要从事图论及其应用研究,E-mail:zhouhq2004@163.com.
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　
周后卿

引用本文:

周后卿. 卡氏积图的Laplacian谱半径的上界[J]. 浙江大学学报（理学版）, 2018, 45(1): 10-13,17.

ZHOU Houqing. Upper bounds of Laplacian spectral radius for the Cartesian product graphs. Journal of Zhejiang University (Science Edition), 2018, 45(1): 10-13,17.

链接本文:

https://www.zjujournals.com/sci/CN/10.3785/j.issn.1008-9497.2018.01.002    或    https://www.zjujournals.com/sci/CN/Y2018/V45/I1/10

[1] MOHAR B. The Laplacian Spectrum of Graphs-Graph theory, Combinatorics and Applications[M]. New York:John Wiley, 1991.
[2] ANDERSON W N, MORLEY T D. Eigenvalues of the Laplacian of a graph[J]. Linear and Multilinear Algebra,1985, 18:141-145.
[3] MERRIS R. A note on Laplacian graph eigenvalues[J]. Linear Algebra and its Applications,1998,285:33-35.
[4] DAS K. An improved upper bound for Laplacian graph eigenvalues[J]. Linear Algebra and its Applications. 2003,368:269-278.
[5] LI J S, ZHANG X D. On the Laplacian eigenvalues of a graph[J].Linear Algebra and its Applications, 1998,285:305-307.
[6] SHI L S. The spectral radius of irregular graphs[J]. Linear Algebra and its Applications, 2009,431:189-196.
[7] STEVANOVIC D. Bounding the largest eigenvalue of trees in terms of the largest vertex degree[J].Linear Algebra and its Applications,2003, 360:35-42.
[8] GUO J M. On the Laplacian spectral radius of a tree[J]. Linear Algebra and its Applications,2003, 368:379-385
[9] FENG L H,YU G H, ILIC A.The Laplacian spectral radius for unicyclic graphs with given independence number[J]. Linear Algebra and its Applications,2010, 433:934-944.
[10] GRONE R, MERRIS R, SUNDER V S. The Laplacian spectrum of a graph[J].SIAM Journal on Matrix Analysis and Applications,1990,11:218-238.
[11] LI J X, SHIU W C,CHAN W H. On the Laplacian spectral radii of bipartite graphs[J].Linear Algebra and its Applications, 2011, 435:2183-2192.
[12] PATRA K L, SAHOO B K, BHUBANESWAR. Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth[J].Czechoslovak Mathematical Journal, 2013,63(138):909-922.
[13] 周后卿.Cartesian积图的最大拉普拉斯特征值[J].邵阳学院学报,2011(1):5-7. ZHOU H Q. The largest eigenvalue of Laplacian matrix of cartesian product graph[J]. Journal of Shaoyang University, 2011(1):5-7.
[14] JIA H C, XUE J. On the Laplacian spectral radii of Halin graphs[J].Journal of Inequalities and Applications, 2017:73.
[15] LIU M H, DAS K C,LAI H J.The (signless) Laplacian spectral radii of c-cyclic graphs with n vertices, girth g and k pendant vertices[J].Linear and Multilinear Algebra, 2017,65(5):869-881.
[16] XING R D,ZHOU B. Laplacian and signless Laplacian spectral radii of graphs with fixed domination number[J]. Mathematische Nachrichten,2015,288(4):476-480.
[17] CVETKOVIC D, DOOB M, SACHS H. Spectra of Graphs, Theory and Applications[M]. Heidelberg:Johann Ambrosius Barth, 1995.
[18] BELL F K, CVETKOVIC D, ROWLINSON P. Graphs for which the least eigenvalue is minimal[J].Linear Algebra and its Applications, 2008, 429:234-241.
[19] YU G D, FAN Y Z, WANG Y. The least eigenvalue of graphs[J]. Journal of Mathematical Research with Applications, 2012, 32(6):659-665.
[1] 贾会才. k路覆盖图的新充分条件[J]. 浙江大学学报（理学版）, 2019, 46(6): 666-669.
[2] 初鲁, 鲍亮, 董贝贝. 求解非埃尔米特正定方程组的广义LHSS迭代法[J]. 浙江大学学报（理学版）, 2018, 45(6): 694-697,706.
[3] 管训贵. 关于丢番图方程X2-(a2+1)Y4=35-12a的讨论[J]. 浙江大学学报（理学版）, 2016, 43(2): 138-143.