{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T03:59:18Z","timestamp":1778644758007,"version":"3.51.4"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"crossref","award":["2018M631322"],"award-info":[{"award-number":["2018M631322"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11731002"],"award-info":[{"award-number":["11731002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"111 Project of China","award":["B16002"],"award-info":[{"award-number":["B16002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> For an integer [Formula: see text], the [Formula: see text]-component connectivity of a graph [Formula: see text], denoted by [Formula: see text], is the minimum number of vertices whose removal from [Formula: see text] results in a disconnected graph with at least [Formula: see text] components or a graph with fewer than [Formula: see text] vertices. This naturally generalizes the classical connectivity of graphs defined in term of the minimum vertex-cut. This kind of connectivity can help us to measure the robustness of the graph corresponding to a network. The hierarchical star networks [Formula: see text], proposed by Shi and Srimani, is a new level interconnection network topology, and uses the star graphs as building blocks. In this paper, by exploring the combinatorial properties and fault-tolerance of [Formula: see text], we study the [Formula: see text]-component connectivity of hierarchical star networks [Formula: see text]. We obtain the results: [Formula: see text], [Formula: see text] and [Formula: see text] for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054120500100","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:07:29Z","timestamp":1588579649000},"page":"313-326","source":"Crossref","is-referenced-by-count":26,"title":["On Component Connectivity of Hierarchical Star Networks"],"prefix":"10.1142","volume":"31","author":[{"given":"Mei-Mei","family":"Gu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China"},{"name":"Faculty of Mathematics and Physics, Charles University, Prague 11800, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-7968","authenticated-orcid":false,"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[{"name":"Institute of Information and Decision Sciences, National Taipei University of Business, Taipei 10051, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8714-8750","authenticated-orcid":false,"given":"Rong-Xia","family":"Hao","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"key":"S0129054120500100BIB001","first-page":"393","volume-title":"Proc. Int\u2019l. Conf. Parallel Process.","author":"Akers S. B.","year":"1987"},{"key":"S0129054120500100BIB002","series-title":"Lecture Notes in Computer Science","first-page":"12","volume-title":"Proc. 12th International Frontiers of Algorithmics Workshop (FAW 2018)","author":"Chang J.-M."},{"key":"S0129054120500100BIB003","first-page":"1","volume":"2","author":"Chartrand G.","year":"1984","journal-title":"Bull. Bombay Math. Colloq."},{"key":"S0129054120500100BIB004","doi-asserted-by":"publisher","DOI":"10.1002\/net.10045"},{"key":"S0129054120500100BIB005","first-page":"1213","volume-title":"Proc. Int. Symp. Pervasive Systems, Algorithms, and Networks (I-SPAN 2014)","author":"Cheng E."},{"key":"S0129054120500100BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265915500073"},{"key":"S0129054120500100BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46376-6_9"},{"key":"S0129054120500100BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.06.010"},{"key":"S0129054120500100BIB009","first-page":"63","volume-title":"Proc. ACM SIGCOMM9","author":"Guo C."},{"key":"S0129054120500100BIB010","first-page":"75","volume-title":"Proc. ACM SIGCOMM","author":"Guo C."},{"issue":"2","key":"S0129054120500100BIB011","first-page":"106","volume":"3","author":"Gu M.-M.","year":"2018","journal-title":"Int. J. Comput. Math. Comput. Sys. Theor."},{"key":"S0129054120500100BIB012","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2011.638978"},{"key":"S0129054120500100BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7906(95)00028-3"},{"key":"S0129054120500100BIB014","first-page":"71","volume":"9","author":"Sampathkumar E.","year":"1984","journal-title":"J. Combin. Inform. Sys. Sci."},{"key":"S0129054120500100BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.05.003"},{"key":"S0129054120500100BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.05.005"},{"key":"S0129054120500100BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.02.035"},{"key":"S0129054120500100BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.09.007"},{"key":"S0129054120500100BIB019","doi-asserted-by":"publisher","DOI":"10.1080\/00207160701619200"},{"key":"S0129054120500100BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.05.035"},{"key":"S0129054120500100BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.228"},{"issue":"8","key":"S0129054120500100BIB022","first-page":"1771","volume":"177","author":"Zheng S.","year":"2007","journal-title":"Tsinghua Sci. Technol."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120500100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:07:52Z","timestamp":1588579672000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120500100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":22,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S0129054120500100"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120500100","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}