摘要
设G为具有n个顶点的简单连通图.本文给出了图G的第k大规范拉普拉斯特征值的两个新上界,分别推广了已有的规范拉普拉斯谱半径的两个上界.
Let G be a simple connected graph of order n. In this paper, we present two upper bounds on the k-th largest normalized Laplacian eigenvalue of G, which generalize two known upper bounds on its normalized Laplacian spectral radius, respectively.
出处
《数学进展》
CSCD
北大核心
2018年第1期51-55,共5页
Advances in Mathematics（China）
基金
supported by NSFC(Nos.11101358,11471077,61379021)
NSF of Fujian(Nos.2014J01020,2015J01018,2016J01673)
China Postdoctoral Science Foundation(No.2014M551831)
关键词
图
第k大规范拉普拉斯特征值
界
graph
k-th largest normalized Laplacian eigenvalue
bound
