On Graphs with Cut Vertices and Cut Edges

作者：Kun; Fu; FANG; Jin; Long; SHU切割割点顶点曲线图谱半径极图

摘要：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).

注：因版权方要求，不能公开全文，如需全文，请咨询杂志社