中文

基于分量连通性的折叠超立方体可靠性评估

组合数学 2018-03-06 v1

摘要

分量连通性是连通性的推广,是互连网络可靠性评估的一个参数。非完全连通图 GGgg-分量连通性 cκg(G)c\kappa_{g}(G) 是指删去最少数量的顶点后使图至少具有 gg 个连通分量的最小顶点数。Hsu 等人在 [Component connectivity of the hypercubes, International Journal of Computer Mathematics 89 (2012) 137-145] 中的结果确定了超立方体的分量连通性。作为超立方体的一种不变体,我们在本文中确定了折叠超立方体的 (g+1)(g+1)-分量连通性 cκg(FQn)=g(n+1)12g(g+1)+1c\kappa_{g}(FQ_{n})=g(n+1)-\frac{1}{2}g(g+1)+1,其中 1gn+1,n81\leq g \leq n+1, n\geq 8

关键词

引用

@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}
}

备注

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]