Reliability evaluation of folded hypercubes in terms of component connectivity

Shuli Zhao; Weihua Yang

Reliability evaluation of folded hypercubes in terms of component connectivity

Combinatorics 2018-03-06 v1

Authors: Shuli Zhao , Weihua Yang

Abstract

The component connectivity is the generalization of connectivity which is an parameter for the reliability evaluation of interconnection networks. The $g$ -component connectivity $c\kappa_{g}(G)$ of a non-complete connected graph $G$ is the minimum number of vertices whose deletion results in a graph with at least $g$ components. The results in [Component connectivity of the hypercubes, International Journal of Computer Mathematics 89 (2012) 137-145] by Hsu et al. determines the component connectivity of the hypercubes. As an invariant of the hypercube, we determine the $(g+1)$ -component connectivity of the folded hypercube $c\kappa_{g}(FQ_{n})=g(n+1)-\frac{1}{2}g(g+1)+1$ for $1\leq g \leq n+1, n\geq 8$ in this paper.

Keywords

component connectivity folded hypercube reliability evaluation interconnection networks vertex deletion

Cite

@article{arxiv.1803.01311,
  title  = {Reliability evaluation of folded hypercubes in terms of component connectivity},
  author = {Shuli Zhao and Weihua Yang},
  journal= {arXiv preprint arXiv:1803.01311},
  year   = {2018}
}

Comments

The work was included in the MS thesis of the first author in [On the component connectiviy of hypercubes and folded hypercubes, MS Thesis at Taiyuan University of Technology, June 2017]

Reliability evaluation of folded hypercubes in terms of component connectivity

Abstract

Keywords

Cite

Comments

Related papers