Connectivity of Double Graphs

Zhayida Simayijiang; Elkin Vumar

Connectivity of Double Graphs

Combinatorics 2015-04-24 v1

Authors: Zhayida Simayijiang , Elkin Vumar

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.

Keywords

graph connectivity rainbow connection graph theory

Cite

@article{arxiv.1504.06196,
  title  = {Connectivity of Double Graphs},
  author = {Zhayida Simayijiang and Elkin Vumar},
  journal= {arXiv preprint arXiv:1504.06196},
  year   = {2015}
}

Related papers

View all related →