{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:54:49Z","timestamp":1758124489870,"version":"3.37.3"},"reference-count":28,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T00:00:00Z","timestamp":1640217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61977016","61572010"],"award-info":[{"award-number":["61977016","61572010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2020J01164","2017J01738"],"award-info":[{"award-number":["2020J01164","2017J01738"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4,15]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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, &amp; if\\ n=2k+1; \\\\ n, &amp; 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)$.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab198","type":"journal-article","created":{"date-parts":[[2021,11,28]],"date-time":"2021-11-28T12:06:18Z","timestamp":1638101178000},"page":"826-841","source":"Crossref","is-referenced-by-count":6,"title":["Cluster Connectivity And Super Cluster Connectivity Of DQcube"],"prefix":"10.1093","volume":"66","author":[{"given":"Qianru","family":"Zhou","sequence":"first","affiliation":[{"name":"College of Mathematics and Statistics , Fujian Normal University, Fuzhou, Fujian 350117 P.R. China"},{"name":"Center for Applied Mathematics of Fujian Province (Fujian Normal University) , Fuzhou, Fujian 350117 P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuming","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics , Fujian Normal University, Fuzhou, Fujian 350117 P.R. China"},{"name":"Center for Applied Mathematics of Fujian Province (Fujian Normal University) , Fuzhou, Fujian 350117 P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqing","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics , Fujian Normal University, Fuzhou, Fujian 350117 P.R. China"},{"name":"Center for Applied Mathematics of Fujian Province (Fujian Normal University) , Fuzhou, Fujian 350117 P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengqin","family":"Yu","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics , Fujian Normal University, Fuzhou, Fujian 350117 P.R. China"},{"name":"Center for Applied Mathematics of Fujian Province (Fujian Normal University) , Fuzhou, Fujian 350117 P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ajmsc.2019.10.001","article-title":"Structure and substructure connectivity of circulant graphs and hypercubes","volume":"27","author":"Chelvam","year":"2021","journal-title":"Arab J. Math. Sci."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","article-title":"On computing a conditional edge-connectivity of a graph","volume":"27","author":"Esfahanian","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"2023041809381768300_","first-page":"49","article-title":"On the extra connectivity of graphs","volume":"155","author":"F\u00e1brega","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.tcs.2020.10.028","article-title":"Structure connectivity and substructure connectivity of wheel networks","volume":"850","author":"Feng","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/net.3230130303","article-title":"Conditional connectivity","volume":"13","author":"Harary","year":"1983","journal-title":"Network"},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2013.06.001","article-title":"DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph","volume":"498","author":"Hung","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/12.620486","article-title":"K-pairwise pluster fault tolerant routing in hypercubes","volume":"46","author":"Gu","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(95)00135-Y","article-title":"Node-to-node cluster fault tolerant routing in star graphs","volume":"56","author":"Gu","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/j.ipl.2010.06.010","article-title":"KCube: A novel architecture for interconnection networks","volume":"110","author":"Guo","year":"2010","journal-title":"Inform. Process. Lett."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.dam.2021.01.017","article-title":"Cluster connectivity of hypercube-based networks under the super fault-tolerance condition","volume":"293","author":"Kung","year":"2021","journal-title":"Discrete Appl. Math."},{"key":"2023041809381768300_","first-page":"125639","article-title":"Structure and substructure connectivity of alternating group graphs","volume":"391","author":"Li","year":"2021","journal-title":"Appl. Math Comput."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.tcs.2019.09.007","article-title":"Structure connectivity and substructure connectivity of twisted hypercubes","volume":"796","author":"Li","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"2023041809381768300_","first-page":"240","volume-title":"Structure connectivity and substructure connectivity of (n, k)-star graph networks","author":"Li","year":"2018"},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2016.04.014","article-title":"Structure connectivity and substructure connectivity of hypercubes","volume":"634","author":"Lin","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"2659","DOI":"10.1007\/s40840-019-00827-4","article-title":"Structure and substructure connectivity of balanced hypercubes","volume":"43","author":"Lv","year":"2020","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.dam.2018.12.032","article-title":"Fault diagnosability of DQcube under the PMC model","volume":"259","author":"Lv","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.akcej.2018.01.009","article-title":"Structure connectivity of hypercubes","volume":"15","author":"Mane","year":"2018","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tcs.2020.04.014","article-title":"Structure connectivity and substructure connectivity of the crossed cube","volume":"824-825","author":"Pan","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.tcs.2017.10.032","article-title":"Structure fault tolerance of hypercubes and folded hypercubes","volume":"711","author":"Sabir","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s11767-008-0126-4","article-title":"A cluster based WSN fault tolerant protocol","volume":"27","author":"Wu","year":"2010","journal-title":"J. Electron.(China)"},{"volume-title":"Combinat orial theory in networks","year":"2013","author":"Xu","key":"2023041809381768300_"},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1142\/S0129054121500088","article-title":"Super C$_k$ and sub-C$_k$ connectivity of k-ary n-cube networks","volume":"32","author":"Yang","year":"2021","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/17445760.2020.1748188","article-title":"Faulty diagnosability and g-extra connectivity of DQcube","volume":"36","author":"Zhang","year":"2021","journal-title":"Int. J. Parallel, Emergent and Distributed Systems"},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1093\/comjnl\/bxaa058","article-title":"Reliability of DQcube based on g-extra conditional fault","volume":"64","author":"Zhang","year":"2021","journal-title":"Comp. J."},{"key":"2023041809381768300_","first-page":"124632","article-title":"Structure connectivity and substructure connectivity of bubble-sort star graph networks","volume":"363","author":"Zhang","year":"2019","journal-title":"Appl. Math Comput."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.dam.2018.05.059","article-title":"The generalized connectivity of alternating group graphs and (n, k)-star graphs","volume":"251","author":"Zhao","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"2023041809381768300_","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.ins.2020.10.057","article-title":"A community detection algorithm based on graph compression for large-scale social networks","volume":"551","author":"Zhao","year":"2021","journal-title":"Inform. Sci."},{"volume-title":"Reliability analysis of multiprocessor systems","year":"2020","author":"Zhou","key":"2023041809381768300_"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/4\/826\/49931986\/bxab198.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/4\/826\/49931986\/bxab198.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T07:43:44Z","timestamp":1699861424000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/4\/826\/6479784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,23]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,12,23]]},"published-print":{"date-parts":[[2023,4,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab198","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,4]]},"published":{"date-parts":[[2021,12,23]]}}}