图依谱半径的排序
Ordering Graphs by Their Spectral Radii
-
摘要: n阶(n≥6)简单连通无向图G的谱半径记为ρ(G)。依G的谱半径从大到小进行了排序,得到如下结果:ρ(Kn)>ρ(Kn-K2)>ρ(Kn-P3)>ρ(Kn-2K2)>ρ(Kn-K1,3)>ρ(Kn-C3)>ρ(Kn-P4)>ρ(Kn-P3∪K2)。Abstract: Let G be a simple connected graph of order n (n ≥ 6) with spectral radius ρ(G).This paper gives the first eight largest spectral radii of graphs ρ(Kn) > ρ(Kn-K2) > ρ(Kn-P3) > ρ(Kn-2K2) > ρ(Kn-K1,3) > ρ(Kn-C3) > ρ(Kn-P4) > ρ(Kn-P3∪K2).