组合数学
数学
特征向量
图形
拉普拉斯算子
离散数学
物理
数学分析
量子力学
作者
Jianfeng Wang,Francesco Belardo,Qiongxiang Huang,Bojana Borovićanin
标识
DOI:10.1016/j.disc.2010.06.030
摘要
In this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of a graph and find all the extremal graphs. Secondly, we consider the second-largest signless Laplacian eigenvalue and we characterize the connected graphs whose second-largest signless Laplacian eigenvalue does not exceed 3. Furthermore, we give the signless Laplacian spectral characterization of the latter graphs. In particular, the well-known friendship graph is proved to be determined by the signless Laplacian spectrum.
科研通智能强力驱动
Strongly Powered by AbleSci AI