The generalized 3-(edge) connectivity of total graphs
Abstract
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 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.