The generalized 3-(edge) connectivity of total graphs

The generalized $k$-connectivity ${\kappa }_k(G)$ of a graph $G$, introduced by Hager in 1985, is a natural generalization of the concept of connectivity $\kappa (G)$, which is just for $k=2$. Total graph is generalized line graph and a large graph which obtained by incidence relation between vertices and edges of original graph. T. Hamada and T. Nonaka et al., in \cite{Hamada} determined the connectivity of the total graph $T(G)$ for a graph $G$. In this paper we determine the generalized $k$-(edge)-connectivity of total graph $T(G)$ for $k=3$.