Ordering Graphs with Cut Edges by Their Spectral Radii  

作　　者：Kun-fu FANG 

机构地区：[1]Faculty of Science,Huzhou Teachers College,Huzhou 313000,China

出　　处：《Acta Mathematicae Applicatae Sinica》2012年第1期193-200,共8页应用数学学报（英文版）

基　　金：Supported by the National Natural Science Foundation of China (No. 11071078)

摘　　要：Let gnk denote a set of graphs with n vertices and k cut edges. In this paper, we obtain an order of the first four graphs in gnk in terms of their spectral radii for 6 ≤ k ≤ n-2/3.Let gnk denote a set of graphs with n vertices and k cut edges. In this paper, we obtain an order of the first four graphs in gnk in terms of their spectral radii for 6 ≤ k ≤ n-2/3.

关 键 词：spectral radius cut edge ORDERING EIGENVALUE 

分 类 号：O157.5[理学—数学] TB657.4[理学—基础数学]