{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:03:02Z","timestamp":1750219382910,"version":"3.41.0"},"reference-count":40,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271157"],"award-info":[{"award-number":["12271157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2022JJ30028"],"award-info":[{"award-number":["2022JJ30028"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2023JJ30072"],"award-info":[{"award-number":["2023JJ30072"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:p> The generalized [Formula: see text]-connectivity of a graph [Formula: see text], denoted by [Formula: see text], is the minimum number of internally edge disjoint [Formula: see text]-trees for any [Formula: see text] with [Formula: see text]. The generalized [Formula: see text]-connectivity of a graph is a natural extension of the classical connectivity and can be served as an essential parameter for measuring reliability and fault tolerance of the network. Hierarchical interconnection networks (HIN\u2019s) are very important in applications related to the modern interconnection networks since they posses many desirable properties. In this paper, we firstly introduce a family of regular networks [Formula: see text] that can be obtained from [Formula: see text] by adding a matching, where [Formula: see text] and [Formula: see text] are vertex-disjoint subgraphs and each [Formula: see text] is isomorphic to a given graph [Formula: see text] ([Formula: see text]). Then we determine the generalized 3-connectivity of [Formula: see text]. As applications of the main result, the generalized 3-connectivity of some HIN\u2019s, such as the hierarchical star network [Formula: see text], the hierarchical cubic network [Formula: see text] and the hierarchical folded hypercube [Formula: see text], can be determined immediately. <\/jats:p>","DOI":"10.1142\/s0129054124500199","type":"journal-article","created":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T10:25:58Z","timestamp":1729247158000},"page":"569-582","source":"Crossref","is-referenced-by-count":0,"title":["The Generalized 3-Connectivity of a Family of Regular Networks"],"prefix":"10.1142","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9677-0899","authenticated-orcid":false,"given":"Jing","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics, Changsha University, Changsha 410022, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5476-1767","authenticated-orcid":false,"given":"Xidao","family":"Luan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Changsha University, Changsha 410022, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6081-6293","authenticated-orcid":false,"given":"Yuanqiu","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Mathematics, Hunan Normal University, Changsha 410081, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"S0129054124500199BIB001","first-page":"393","volume-title":"Proc. Int\u2019l Conf. Parallel Process","author":"Akers S. B.","year":"1987"},{"volume-title":"Graph Theory","year":"2007","author":"Bondy J. A.","key":"S0129054124500199BIB002"},{"key":"S0129054124500199BIB003","first-page":"1","volume":"2","author":"Chartrand G.","year":"1984","journal-title":"Bombay Math."},{"issue":"4","key":"S0129054124500199BIB004","first-page":"360","volume":"55","author":"Chartrand G.","year":"2010","journal-title":"Networks"},{"key":"S0129054124500199BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9955-x"},{"key":"S0129054124500199BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2014.235"},{"key":"S0129054124500199BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/12.53600"},{"key":"S0129054124500199BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"key":"S0129054124500199BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/71.372797"},{"key":"S0129054124500199BIB010","first-page":"106","volume":"3","author":"Gu M.","year":"2018","journal-title":"International J. Comput. Math.: Comput. Sys. Theory"},{"key":"S0129054124500199BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.04.022"},{"key":"S0129054124500199BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224157"},{"key":"S0129054124500199BIB013","first-page":"193","volume":"114","author":"Li H.","year":"2014","journal-title":"Ars Combin."},{"issue":"1","key":"S0129054124500199BIB014","first-page":"43","volume":"14","author":"Li H.","year":"2012","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"S0129054124500199BIB015","first-page":"77","volume":"295","author":"Li H.","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"S0129054124500199BIB016","first-page":"65","volume":"104","author":"Li S.","year":"2012","journal-title":"Ars Combin."},{"key":"S0129054124500199BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9399-x"},{"key":"S0129054124500199BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.04.011"},{"key":"S0129054124500199BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-017-1837-9"},{"key":"S0129054124500199BIB020","first-page":"41","volume":"274","author":"Li S.","year":"2016","journal-title":"Appl. Math. Comput."},{"key":"S0129054124500199BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.07.021"},{"key":"S0129054124500199BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.12.003"},{"key":"S0129054124500199BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.01.020"},{"key":"S0129054124500199BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.05.003"},{"key":"S0129054124500199BIB025","first-page":"134","volume-title":"Proceedings of the 4th International Conference, Exhibition on High Performance Computing in the Asia-Pacific Region","volume":"1","author":"Shi Y.","year":"2000"},{"key":"S0129054124500199BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.04.022"},{"key":"S0129054124500199BIB027","series-title":"Reprinted in Tutorial on Parallel Processing","first-page":"39","volume-title":"Proc. Nat. Comput. Conf.","author":"Swan R. J.","year":"1977"},{"key":"S0129054124500199BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.09.013"},{"key":"S0129054124500199BIB029","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxac137"},{"key":"S0129054124500199BIB030","doi-asserted-by":"publisher","DOI":"10.1515\/math-2022-0490"},{"key":"S0129054124500199BIB031","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.12.011"},{"key":"S0129054124500199BIB032","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"},{"key":"S0129054124500199BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.03.008"},{"key":"S0129054124500199BIB034","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.11.020"},{"key":"S0129054124500199BIB035","doi-asserted-by":"publisher","DOI":"10.1093\/computer_journal\/bxy054"},{"key":"S0129054124500199BIB036","first-page":"342","volume":"347","author":"Zhao S.","year":"2019","journal-title":"Applied Math. Comput."},{"key":"S0129054124500199BIB037","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054119500229"},{"key":"S0129054124500199BIB038","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.09.025"},{"key":"S0129054124500199BIB039","first-page":"126990","volume":"422","author":"Zhao S.","year":"2022","journal-title":"Appl. Math. Comput."},{"key":"S0129054124500199BIB040","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\/S0129054124500199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T07:45:36Z","timestamp":1750146336000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054124500199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"references-count":40,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10.1142\/S0129054124500199"],"URL":"https:\/\/doi.org\/10.1142\/s0129054124500199","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2024,10,17]]}}}