-

Center for Theoretical Physics and
Mathematics, Atomic Energy Organization of
Iran
For any fixed integers m, n, with in m? n + 1, we consider classes of graphs G , that are n-connected with the minimum number of edges. G graphs are examples of graphs with maximum connectivity. This property makes them useful to network designers and thus it is of interest to study the behavior of other stability parameters for these gaphs. In this paper we study the tenacity of the 0
when “m” is even and “n” is odd number.