{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:17:07Z","timestamp":1779934627909,"version":"3.53.1"},"reference-count":20,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2018J01419"],"award-info":[{"award-number":["2018J01419"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301217"],"award-info":[{"award-number":["11301217"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571139"],"award-info":[{"award-number":["11571139"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"New Century Excellent Talents in Fujian Province University","award":["JA14168"],"award-info":[{"award-number":["JA14168"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p> Let [Formula: see text] be a non-complete graph, a subset [Formula: see text] is called a [Formula: see text]-component cut of [Formula: see text], if [Formula: see text] is disconnected and has at least [Formula: see text] components. The cardinality of the minimum [Formula: see text]-component cut is the [Formula: see text]-component connectivity of [Formula: see text] and is denoted by [Formula: see text]. The [Formula: see text]-component connectivity is a natural extension of the classical connectivity. As an application, the [Formula: see text]-component connectivity can be used to evaluate the reliability and fault tolerance of an interconnection network structure based on a graph model. In a previous work, E. Cheng et\u00a0al. obtained the [Formula: see text]-component connectivity of the generalized exchanged hypercube [Formula: see text] for [Formula: see text] and [Formula: see text]. In this paper, we continue the work and determine that [Formula: see text] for [Formula: see text]. Moreover, we show that every optimal [Formula: see text]-component cut of [Formula: see text] is trivial for [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129626420500097","type":"journal-article","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T07:37:01Z","timestamp":1594971421000},"page":"2050009","source":"Crossref","is-referenced-by-count":3,"title":["Reliability Analysis of the Generalized Exchanged Hypercube"],"prefix":"10.1142","volume":"30","author":[{"given":"Qifan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Science, Jimei University, Xiamen, Fujian 361021, P. R. China"},{"name":"Digital Fujian big data modeling and Intelligent Computing Institute, Xiamen, Fujian 361021, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liqiong","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Science, Jimei University, Xiamen, Fujian 361021, P. R. China"},{"name":"Digital Fujian big data modeling and Intelligent Computing Institute, Xiamen, Fujian 361021, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shanshan","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Science, Jimei University, Xiamen, Fujian 361021, P. R. China"},{"name":"Digital Fujian big data modeling and Intelligent Computing Institute, Xiamen, Fujian 361021, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2020,7,17]]},"reference":[{"key":"S0129626420500097BIB001","volume-title":"Graph Theory and Its Application","author":"Bondy J. A.","year":"2008"},{"key":"S0129626420500097BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78455-7_1"},{"key":"S0129626420500097BIB003","author":"Chang J.-M.","year":"2018","journal-title":"Theoret. Comput. Sci."},{"key":"S0129626420500097BIB004","first-page":"1","volume":"2","author":"Chartrand G.","year":"1984","journal-title":"Bull. Bombay Math. Colloq."},{"key":"S0129626420500097BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.113"},{"key":"S0129626420500097BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.10.029"},{"key":"S0129626420500097BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.11.014"},{"key":"S0129626420500097BIB008","first-page":"215","volume":"24","author":"Cheng E.","year":"2017","journal-title":"Emerg. Comput."},{"key":"S0129626420500097BIB009","first-page":"1213","volume-title":"Proc. Int. Symp. Pervasive Systems, Algorithms, and Networks (I-SPAN\u00a02014)","author":"Cheng E."},{"key":"S0129626420500097BIB010","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265915500073"},{"key":"S0129626420500097BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.10.016"},{"key":"S0129626420500097BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2018.03.107"},{"key":"S0129626420500097BIB013","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2011.638978"},{"key":"S0129626420500097BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(99)00003-1"},{"key":"S0129626420500097BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1006"},{"key":"S0129626420500097BIB016","first-page":"71","volume":"9","author":"Sampathkumar E.","year":"1984","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"S0129626420500097BIB017","doi-asserted-by":"publisher","DOI":"10.1080\/00207160500113173"},{"key":"S0129626420500097BIB018","author":"Zhao S. L.","year":"2018","journal-title":"Discr. Appl. Math."},{"key":"S0129626420500097BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.05.035"},{"key":"S0129626420500097BIB020","author":"Zhao S. L.","year":"2018","journal-title":"Discr. Appl. Math."}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626420500097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T07:37:31Z","timestamp":1594971451000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626420500097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":20,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S0129626420500097"],"URL":"https:\/\/doi.org\/10.1142\/s0129626420500097","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}