On graphs with cut vertices and cut edges

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).