On Graphs with Cut Vertices and Cut Edges  

作　　者：Kun Fu FANG Jin Long SHU 

机构地区：[1]Faculty of Science,Huzhou Teachers College [2]Department of Mathematics,East China Normal University

出　　处：《Acta Mathematica Sinica,English Series》2014年第3期539-546,共8页数学学报（英文版）

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

摘　　要：Let G（n,k,t） be a set of graphs with n vertices,k cut edges and t cut vertices.In this paper,we classify these graphs in G（n,k,t） according to cut vertices,and characterize the extremal graphs with the largest spectral radius in G（n,k,t）.Let G（n,k,t） be a set of graphs with n vertices,k cut edges and t cut vertices.In this paper,we classify these graphs in G（n,k,t） according to cut vertices,and characterize the extremal graphs with the largest spectral radius in G（n,k,t）.

关 键 词：Spectral radius extremal graph cut vertex cut edge 

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