Connectivity of Double Graphs (1504.06196v1)

Published 23 Apr 2015 in math.CO

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.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Generate a whiteboard explanation of this paper.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.