{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:30:53Z","timestamp":1749011453608,"version":"3.30.2"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:p> Let [Formula: see text] be a connected graph, and [Formula: see text] with [Formula: see text]. [Formula: see text] refers to the maximum number [Formula: see text] of edge-disjoint trees [Formula: see text] in [Formula: see text] such that [Formula: see text] for distinct [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text], denoted by [Formula: see text], is defined as the minimum value of [Formula: see text] over all [Formula: see text] with [Formula: see text]. In fact, [Formula: see text] is exactly the traditional connectivity of [Formula: see text]. Exchanged crossed cube [Formula: see text], a variation of hypercube, has better properties than other variations of hypercube. In this work we obtain that [Formula: see text] with [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054124500011","type":"journal-article","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T04:15:58Z","timestamp":1707279358000},"page":"975-985","source":"Crossref","is-referenced-by-count":1,"title":["The Generalized 3-Connectivity of Exchanged Crossed Cube"],"prefix":"10.1142","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0995-1246","authenticated-orcid":false,"given":"Wantao","family":"Ning","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Xidian University, Xi\u2019an, Shaanxi, 710071, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1410-8509","authenticated-orcid":false,"given":"Litao","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Xiamen University of Technology, Xiamen, Fujian, 361024, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2024,2,6]]},"reference":[{"volume-title":"Graph Theory","year":"2007","author":"Bondy J. A.","key":"S0129054124500011BIB001"},{"key":"S0129054124500011BIB002","first-page":"1","volume":"2","author":"Chartrand G.","year":"1984","journal-title":"Bull. Bombay Math. Colloq."},{"issue":"4","key":"S0129054124500011BIB003","first-page":"360","volume":"55","author":"Chartrand G.","year":"2010","journal-title":"Networks"},{"key":"S0129054124500011BIB004","doi-asserted-by":"publisher","DOI":"10.1142\/6729"},{"key":"S0129054124500011BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/71.159036"},{"key":"S0129054124500011BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00012-4"},{"key":"S0129054124500011BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9399-x"},{"key":"S0129054124500011BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.04.011"},{"key":"S0129054124500011BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.330"},{"key":"S0129054124500011BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.12.003"},{"journal-title":"Discussiones Mathematicae Graph Theory","author":"Liu H. Q.","key":"S0129054124500011BIB011"},{"volume-title":"Algorithms for VLSI Physical Design Automation","year":"1999","author":"Sherwani N. A.","key":"S0129054124500011BIB012"},{"key":"S0129054124500011BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.09.013"},{"key":"S0129054124500011BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"S0129054124500011BIB015","first-page":"342","volume":"347","author":"Zhao S.","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"S0129054124500011BIB016","doi-asserted-by":"publisher","DOI":"10.1093\/computer_journal\/bxy054"},{"key":"S0129054124500011BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.09.026"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054124500011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T04:22:49Z","timestamp":1734582169000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054124500011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,6]]},"references-count":17,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.1142\/S0129054124500011"],"URL":"https:\/\/doi.org\/10.1142\/s0129054124500011","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2024,2,6]]}}}