Least Q-Eigenvalues Of Nonbipartite 2-Connected Graphs

DISCRETE APPLIED MATHEMATICS(2021)

引用 0|浏览5
暂无评分
摘要
Among all simple nonbipartite 2-connected graphs, the minimum least Q-eigenvalues are completely determined. As for the nonbipartite theta-graphs known as a special class of 2-connected graphs, the minimum least Q-eigenvalues are also completely determined. (C) 2021 Elsevier B.V. All rights reserved.
更多
查看译文
关键词
Signless Laplacian, Least Q-eigenvalue, Nonbipartite, 2-connected graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要