Tenacity of a graph with maximum connectivity

The tenacity of a graph GG, T(G)T(G), is defined by T(G)=min{|S|+τ(G−S)ω(G−S)}, where the minimum is taken over all vertex cutsets SS of V(G)V(G), ω(G−S)ω(G−S) is the number of components of G−SG−S and τ(G−S)τ(G−S) is the number of vertices in the largest component of the graph induced by G−SG−S.In this paper we choose the spectrum of a graph, Gnm, which is nn-vertex-connected with minimum number of edges and we calculate the tenacity of Gnm.