当前位置: X-MOL 学术Eur. J. Comb. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On graphs whose second largest eigenvalue is at most 1
European Journal of Combinatorics ( IF 1 ) Pub Date : 2021-06-25 , DOI: 10.1016/j.ejc.2021.103385
Muhuo Liu , Chaohui Chen , Zoran Stanić

We determine all connected {K1,3,K5e}-free graphs whose second largest eigenvalue does not exceed 1. Our result includes all connected line graphs with the same spectral property, and therefore strengthens the result of Petrović and Milekić (1998).



中文翻译:

在第二大特征值至多为 1 的图上

我们确定所有连接 {1,3,5-电子}-free 图的第二大特征值不超过 1。我们的结果包括所有具有相同谱属性的连接线图,因此加强了 Petrović 和 Milekić (1998) 的结果。

更新日期:2021-06-28
down
wechat
bug