Connectivity of Double Graphs
Abstract
The double graph of a graph G is defined as D[G] = G × T2, where \(T2\) is the total graph with 2 vertices and × stands for the Kronecker product of graphs. In this paper, sufficient conditions for double graphs to be maximum vertex-connected, maximum edge-connected are presented.
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.