Cluster Connectivity And Super Cluster Connectivity Of DQcube

Author:

Zhou Qianru12,Zhou Shuming12,Liu Xiaoqing12,Yu Zhengqin12

Affiliation:

1. College of Mathematics and Statistics, Fujian Normal University, Fuzhou, Fujian 350117 P.R. China

2. Center for Applied Mathematics of Fujian Province (Fujian Normal University), Fuzhou, Fujian 350117 P.R. China

Abstract

Abstract As a fundamental metric, the connectivity to assess fault tolerance and reliability of interconnection networks has been extensively explored. However, classical connectivity is not very effective at evaluating large-scale networking systems. To overcome this deficiency, two new indices, cluster connectivity and super cluster connectivity, have been proposed to characterize the robustness of interconnection networks. This paper focuses on investigating $\mathcal{H} (\mathcal{H}^{*})$-cluster connectivity and super $\mathcal{H} (\mathcal{H}^{*})$-connectivity of composition graph $DQ_{n}$, based on disc-ring and hypercube, for $\mathcal{H}\in \{K_{1,r}\ |\ 0\leq r\leq n+1\}$, respectively. In detail, we show that $\kappa (DQ_{n}|K_{1,1} (K_{1,1}^{*}))=\kappa ^{\prime}(DQ_{n}|K_{1,1}(K_{1,1}^{*})) =n+1 (n\geq 3)$, $\kappa (DQ_{n}|K_{1,r}(K_{1,r}^{*})) =\left\lceil \frac{n}{2}\right\rceil +1 (2\leq r\leq 4)$ for $n\geq 3$, $\kappa ^{\prime}(DQ_{n}|K_{1}(K_{1}^{*})) =\kappa ^{\prime}(DQ_{n})=2n (n\geq 3)$, and for $2\leq r\leq 3$ and $k\geq 2$, $$\begin{align*} \kappa^{\prime}(DQ_{n}|K_{1,r}(K_{1,r}^{*}))=\left\{\begin{array}{@{}ll} n+1, & if\ n=2k+1; \\ n, & if\ n=2k. \end{array}\right. \end{align*}$$As by-products, we show that DQcube is super $K_{1,r}-\ (K_{1,r}^{*}-)$connected $(2\leq r\leq 3)$, and derive the 4-extra connectivity of DQcube $\kappa _{4}(DQ_{n}) = 5n-9 (n\geq 4)$.

Funder

National Natural Science Foundation of China

Natural Science Foundation of Fujian Province

Publisher

Oxford University Press (OUP)

Subject

General Computer Science

Reference28 articles.

1. Structure and substructure connectivity of circulant graphs and hypercubes;Chelvam;Arab J. Math. Sci.,2021

2. On computing a conditional edge-connectivity of a graph;Esfahanian;Inform. Process. Lett.,1988

3. On the extra connectivity of graphs;Fábrega;Discrete Appl. Math.,1996

4. Structure connectivity and substructure connectivity of wheel networks;Feng;Theor. Comput. Sci.,2020

5. Conditional connectivity;Harary;Network,1983

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Hyper star structure fault tolerance of half hypercube;The Journal of Supercomputing;2024-07-08

2. Reliability of Half Hypercube Networks under Cluster Faults;2024 27th International Conference on Computer Supported Cooperative Work in Design (CSCWD);2024-05-08

3. Star structure fault tolerance of Bicube networks;International Journal of Computer Mathematics: Computer Systems Theory;2024-01-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3