2016/08/06 by Yinkui Li, Li, Yinkui
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1608.02055
arXiv admin note: substantial text overlap with arXiv:1207.1838, arXiv:1603.03995, arXiv:1305.1089, arXiv:1604.01887 by other authors
arxiv created 2016/10/02 · arxiv updated 2016/10/04
The generalized k-connectivity κk(G) of a graph G, introduced by Hager in 1985, is a natural generalization of the concept of connectivity κ(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 \citeHamada 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.