2000 character limit reached
Connectivity of Double Graphs
Published 23 Apr 2015 in math.CO | (1504.06196v1)
Abstract: The double graph of a graph $G$ is defined as $\mathcal{D}[G]$ = $G \times T_2$, where (T_2) is the total graph with 2 vertices and $\times$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.