摘要
图的拉普拉斯谱半径是其拉普拉斯矩阵的最大特征值.本文刻画了(边)连通度至多为k的二部图中具有最大拉普拉斯谱半径的所有图.[Linear Algebra Appl.,2009,431(1):99-103]也考虑了此问题,而所得到的结果并不完整.
The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix.In this note,we characterize those graphs which maximize the Laplacian spectral radii among all the bipartite graphs with(edge-) connectivity at most k which was considered in[Linear Algebra Appl.,2009,431(1):99-103]and the obtained results are not complete.
出处
《数学进展》
CSCD
北大核心
2014年第4期578-580,共3页
Advances in Mathematics（China）
基金
Supported by NSFC(No.11101263,No.11101358)
a grant of "The First-class Discipline of Universities in Shanghai"
NSF of Fujian(No.2014J01020)
关键词
拉普拉斯谱半径
二部图
连通度
Laplacian spectral radius
bipartite graph
connectivity
