{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:29:20Z","timestamp":1747189760101,"version":"3.40.5"},"reference-count":29,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","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":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:p> The vertex (edge) connectivity has been regularly used to measure the fault tolerance and reliability of interconnection networks, while it has defects in the assumption that all neighbors of one node will fail concurrently. To overcome this deficiency, some new generalizations of traditional connectivity have been suggested to quantize the size or the number of the connected components of the survival graph. The [Formula: see text]-component (edge) connectivity, one generalization of vertex (edge) connectivity, has been proposed to characterize the vulnerability of multiprocessor systems based on the number of components of the survival graph. In this paper, we determine the [Formula: see text]-component (edge) connectivity of a family of networks, called the round matching composition networks [Formula: see text], which are a class of networks composed of [Formula: see text] ([Formula: see text]) clusters with the same order, linked by [Formula: see text] perfect matchings. By exploring the combinatorial properties and fault-tolerance of [Formula: see text], we establish the [Formula: see text]-component (edge) connectivity [Formula: see text] for [Formula: see text] and [Formula: see text], [Formula: see text] and [Formula: see text] for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054122500125","type":"journal-article","created":{"date-parts":[[2022,5,29]],"date-time":"2022-05-29T15:19:41Z","timestamp":1653837581000},"page":"1005-1018","source":"Crossref","is-referenced-by-count":0,"title":["The Component (Edge) Connectivity of Round Matching Composition Networks"],"prefix":"10.1142","volume":"33","author":[{"given":"Xiaoqing","family":"Liu","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6481-3981","authenticated-orcid":false,"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"}]},{"given":"Hong","family":"Zhang","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"}]},{"given":"Baohua","family":"Niu","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"}]}],"member":"219","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"S0129054122500125BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0129054122500125BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.09.018"},{"key":"S0129054122500125BIB003","first-page":"1","volume":"2","author":"Chartrand G.","year":"1984","journal-title":"Bull. Bombay. Math. Colloq."},{"key":"S0129054122500125BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.05.010"},{"key":"S0129054122500125BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(02)00223-0"},{"key":"S0129054122500125BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.11.085"},{"key":"S0129054122500125BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.06.015"},{"key":"S0129054122500125BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.10.008"},{"key":"S0129054122500125BIB009","first-page":"313","volume":"3","author":"Gu M.-M.","year":"2020","journal-title":"Int. J. Founda. Comput. Sci."},{"key":"S0129054122500125BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.10.018"},{"key":"S0129054122500125BIB011","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxz058"},{"key":"S0129054122500125BIB012","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130303"},{"key":"S0129054122500125BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.05.006"},{"key":"S0129054122500125BIB014","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2011.638978"},{"key":"S0129054122500125BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2015.2413372"},{"key":"S0129054122500125BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.11.004"},{"key":"S0129054122500125BIB017","first-page":"9793082","author":"Li X.","year":"2020","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"S0129054122500125BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.11.047"},{"issue":"4","key":"S0129054122500125BIB019","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/71.273045","volume":"5","author":"Soh S.","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"S0129054122500125BIB020","first-page":"71","volume":"9","author":"Sampathkumar E.","year":"1984","journal-title":"J. Combin. Inform. Sys. Sci."},{"key":"S0129054122500125BIB021","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10878-010-9362-2","volume":"23","author":"Shi T.","year":"2012","journal-title":"J. Comb. Optim."},{"key":"S0129054122500125BIB022","first-page":"1","author":"Wu X.","year":"2007","journal-title":"IEEE Int Symp Parallel Distrib. Process Workshops Phd Forum."},{"key":"S0129054122500125BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.09.012"},{"key":"S0129054122500125BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2017.10.005"},{"key":"S0129054122500125BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.05.035"},{"key":"S0129054122500125BIB026","doi-asserted-by":"publisher","DOI":"10.1142\/S012905411850017X"},{"key":"S0129054122500125BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.09.025"},{"key":"S0129054122500125BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.09.022"},{"key":"S0129054122500125BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.05.033"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054122500125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T03:47:21Z","timestamp":1670989641000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054122500125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,28]]},"references-count":29,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["10.1142\/S0129054122500125"],"URL":"https:\/\/doi.org\/10.1142\/s0129054122500125","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2022,5,28]]}}}