Some results related to the tenacity and existence of k-trees
Discrete Applied Mathematics
Note: A note on "Tenacity of a graph with maximum connectivity"
Discrete Applied Mathematics
| Hi-index | 0.04 |
The tenacity of a graph G, T(G), is defined by T(G)=min{|S|+@t(G-S)@w(G-S)}, where the minimum is taken over all vertex cutsets S of V(G), @w(G-S) is the number of components of G-S and @t(G-S) is the number of vertices in the largest component of the graph induced by G-S. In this paper we choose the spectrum of a graph, G"n^m, which is n-vertex-connected with minimum number of edges and we calculate the tenacity of G"n^m.