Bounding the sum of the largest signless Laplacian eigenvalues of a graph

arxiv(2023)

引用 0|浏览7
暂无评分
摘要
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.
更多
查看译文
关键词
05C50,05C35
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要