{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T17:21:21Z","timestamp":1772558481794,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T00:00:00Z","timestamp":1746230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T00:00:00Z","timestamp":1746230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302107"],"award-info":[{"award-number":["62302107"]}],"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":["62366007"],"award-info":[{"award-number":["62366007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Fund of Guangxi Key Lab of Multi source Information Mining Security","award":["24-A-03-01"],"award-info":[{"award-number":["24-A-03-01"]}]},{"name":"Basic Ability Enhancement Program for Young and Middle-Aged Teachers of Guangxi, China","award":["2023KY0063"],"award-info":[{"award-number":["2023KY0063"]}]},{"DOI":"10.13039\/501100013091","name":"Science and Technology Major Project of Guangxi","doi-asserted-by":"publisher","award":["GuikeAD21220114"],"award-info":[{"award-number":["GuikeAD21220114"]}],"id":[{"id":"10.13039\/501100013091","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2024JJB170073"],"award-info":[{"award-number":["2024JJB170073"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07272-0","type":"journal-article","created":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T12:16:12Z","timestamp":1746274572000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A novel fault-tolerant technique for star graph-based interconnection networks"],"prefix":"10.1007","volume":"81","author":[{"given":"Wenfei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiafei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingli","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,3]]},"reference":[{"issue":"3","key":"7272_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/net.3230130303","volume":"13","author":"F Harary","year":"1983","unstructured":"Harary F (1983) Conditional connectivity. Networks 13(3):347\u2013357","journal-title":"Networks"},{"issue":"1","key":"7272_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(94)00369-T","volume":"155","author":"J F\u00e0brega","year":"1996","unstructured":"F\u00e0brega J, Fiol MA (1996) On the extraconnectivity of graphs. Discret Math 155(1):49\u201357","journal-title":"Discret Math"},{"issue":"3","key":"7272_CR3","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1109\/TR.2016.2570559","volume":"65","author":"L Xu","year":"2016","unstructured":"Xu L, Lin L, Zhou S, Hsieh S-Y (2016) The extra connectivity, extra conditional diagnosability, and $$t$$\/$$m$$-diagnosability of arrangement graphs. IEEE Trans Reliab 65(3):1248\u20131262","journal-title":"IEEE Trans Reliab"},{"issue":"2","key":"7272_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10878-023-01098-3","volume":"47","author":"T Liang","year":"2024","unstructured":"Liang T, Zhang M, Liu S (2024) Concentration behavior: 50 percent of $$h$$-extra edge connectivity of pentanary $$n$$-cube with exponential faulty edges. J Comb Optim 47(2):3","journal-title":"J Comb Optim"},{"key":"7272_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2019.07.002","volume":"108","author":"C-W Cheng","year":"2020","unstructured":"Cheng C-W, Hsieh S-Y, Klasing R (2020) Vulnerability of super extra edge-connected graphs. J Comput Syst Sci 108:1\u20139","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"7272_CR6","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TR.2023.3330685","volume":"73","author":"L Xu","year":"2024","unstructured":"Xu L, Zhou S (2024) Reliability assessment of interconnection networks based on link fault patterns. IEEE Trans Reliab 73(2):1302\u20131309","journal-title":"IEEE Trans Reliab"},{"issue":"2","key":"7272_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TPDS.2021.3093243","volume":"33","author":"L Lin","year":"2022","unstructured":"Lin L, Huang Y, Xu L, Hsieh S-Y (2022) A pessimistic fault diagnosability of large-scale connected networks via extra connectivity. IEEE Trans Parallel Distrib Syst 33(2):415\u2013428","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"7272_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2024.103552","volume":"145","author":"Z Wang","year":"2024","unstructured":"Wang Z, Mao Y, Hsieh S-Y, Klasing R, Xiao Y (2024) The $$g$$-extra connectivity of graph products. J Comput Syst Sci 145:103552","journal-title":"J Comput Syst Sci"},{"key":"7272_CR9","first-page":"1","volume":"2","author":"G Chartrand","year":"1984","unstructured":"Chartrand G, Kapoor SF, Lesniak L, Lick DR (1984) Generalized connectivity in graphs. Bull Bombay Math Colloq 2:1\u20136","journal-title":"Bull Bombay Math Colloq"},{"issue":"1","key":"7272_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1093\/comjnl\/bxz136","volume":"64","author":"X Li","year":"2021","unstructured":"Li X, Lin C-K, Fan J, Jia X, Cheng B, Zhou J (2021) Relationship between extra connectivity and component connectivity in networks. Comput J 64(1):38\u201353","journal-title":"Comput J"},{"issue":"9","key":"7272_CR11","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1093\/comjnl\/bxz058","volume":"63","author":"M-M Gu","year":"2020","unstructured":"Gu M-M, Chang J-M, Hao R-X (2020) On computing component (edge) connectivities of balanced hypercubes. Comput J 63(9):1311\u20131320","journal-title":"Comput J"},{"issue":"1","key":"7272_CR12","doi-asserted-by":"publisher","first-page":"2487","DOI":"10.1109\/TR.2024.3410526","volume":"74","author":"H Liu","year":"2025","unstructured":"Liu H, Zhang M, Hsieh S-Y, Lee C-W (2025) A novel links fault tolerant analysis: G-good r-component edge-connectivity of interconnection networks with applications to hypercubes. IEEE Trans Reliab 74(1):2487\u20132496","journal-title":"IEEE Trans Reliab"},{"key":"7272_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2020.06.015","volume":"835","author":"T Ding","year":"2020","unstructured":"Ding T, Li P, Xu M (2020) The component (edge) connectivity of shuffle-cubes. Theoret Comput Sci 835:108\u2013119","journal-title":"Theoret Comput Sci"},{"key":"7272_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2020.04.012","volume":"824\u2013825","author":"P Li","year":"2020","unstructured":"Li P, Xu M (2020) The largest component of faulty star graphs. Theoret Comput Sci 824\u2013825:57\u201366","journal-title":"Theoret Comput Sci"},{"key":"7272_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.jpdc.2020.08.009","volume":"147","author":"Q Zhang","year":"2021","unstructured":"Zhang Q, Xu L, Yang W (2021) Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity. J Parallel Distrib Comput 147:124\u2013131","journal-title":"J Parallel Distrib Comput"},{"key":"7272_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jpdc.2021.12.004","volume":"162","author":"J Liu","year":"2022","unstructured":"Liu J, Zhou S, Wang D, Zhang H (2022) Component diagnosability in terms of component connectivity of hypercube-based compound networks. J Parallel Distrib Comput 162:17\u201326","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"7272_CR17","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TR.2021.3089466","volume":"71","author":"L Xu","year":"2022","unstructured":"Xu L, Zhou S, Hsieh S-Y (2022) An $${O(log_{3}N)}$$ algorithm for reliability assessment of 3-ary $$n$$-cubes based on $$h$$-extra edgeconnectivity. IEEE Trans Reliab 71(3):1230\u20131240","journal-title":"IEEE Trans Reliab"},{"issue":"4","key":"7272_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1142\/S0129054122500228","volume":"34","author":"H Zhang","year":"2023","unstructured":"Zhang H, Zhou S, Zhang Q (2023) Component connectivity of alternating group networks and godan graphs. Int J Found Comput Sci 34(4):395\u2013410","journal-title":"Int J Found Comput Sci"},{"issue":"3","key":"7272_CR19","first-page":"1","volume":"39","author":"Y Huang","year":"2023","unstructured":"Huang Y, Wen K, Lin L, Xu L, Hsieh S-Y (2023) Component fault diagnosability of hierarchical cubic networks. ACM Trans Des Autom Electron Syst 39(3):1\u201319","journal-title":"ACM Trans Des Autom Electron Syst"},{"issue":"2","key":"7272_CR20","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TR.2022.3194021","volume":"72","author":"X Sun","year":"2023","unstructured":"Sun X, Fan J, Kan S, Fan W, Jia X (2023) Component reliability of a class of regular networks and its applications. IEEE Trans Reliab 72(2):637\u2013650","journal-title":"IEEE Trans Reliab"},{"key":"7272_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113784","volume":"952","author":"Q Zhang","year":"2023","unstructured":"Zhang Q, Zhou S, Cheng E (2023) Component connectivity of augmented cubes. Theor Comput Sci 952:113784","journal-title":"Theor Comput Sci"},{"issue":"1","key":"7272_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3478018","volume":"69","author":"A Gupta","year":"2022","unstructured":"Gupta A, Harris DG, Lee E, Li J (2022) Optimal bounds for the $$k$$-cut problem. J ACM 69(1):1\u201318","journal-title":"J ACM"},{"key":"7272_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2023.128318","volume":"461","author":"Q Zhou","year":"2024","unstructured":"Zhou Q, Liu H, Cheng B, Wang Y, Han Y, Fan J (2024) Fault tolerance of recursive match networks based on $$g$$-good-neighbor fault pattern. Appl Math Comput 461:128318","journal-title":"Appl Math Comput"},{"issue":"16","key":"7272_CR24","doi-asserted-by":"publisher","first-page":"24738","DOI":"10.1007\/s11227-024-06342-z","volume":"80","author":"Q Zhang","year":"2024","unstructured":"Zhang Q, Zhou S, Yang L (2024) Link fault tolerability of 3-ary n-cube based on g-good-neighbor r-component edge-connectivity. J Supercomput 80(16):24738\u201324757","journal-title":"J Supercomput"},{"key":"7272_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2024.129160","volume":"489","author":"Y Yang","year":"2025","unstructured":"Yang Y, Zhang M, Meng J (2025) Fault tolerance assessment for hamming graphs based on r-restricted R-structure(substructure) fault pattern. Appl Math Comput 489:129160","journal-title":"Appl Math Comput"},{"key":"7272_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2024.129098","volume":"487","author":"H Qiao","year":"2025","unstructured":"Qiao H, Meng J (2025) Disjoint path covers of star graphs. Appl Math Comput 487:129098","journal-title":"Appl Math Comput"},{"key":"7272_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2023.128343","volume":"462","author":"Y Yang","year":"2024","unstructured":"Yang Y, Zhang M, Meng J (2024) Link fault tolerance of BC networks and folded hypercubes on $$h$$-extra $$r$$-component edge-connectivity. Appl Math Comput 462:128343","journal-title":"Appl Math Comput"},{"key":"7272_CR28","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2021.09.030","volume":"895","author":"B Li","year":"2021","unstructured":"Li B, Lan J, Ning W, Tian Y, Zhang X, Zhu Q (2021) $$h$$-extra $$r$$-component connectivity of interconnection networks with application to hypercubes. Theor Comput Sci 895:68\u201374","journal-title":"Theor Comput Sci"},{"key":"7272_CR29","volume-title":"Reliability analysis of multiprocessor systems","author":"S Zhou","year":"2020","unstructured":"Zhou S, Dong Q (2020) Reliability analysis of multiprocessor systems. Science Press, Beijing"},{"issue":"4","key":"7272_CR30","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"Sb Akers","year":"1989","unstructured":"Akers Sb, Krishnamurthy B (1989) A group-theoretic model for symmetric interconnection networks. IEEE Trans Comput 38(4):555\u2013566","journal-title":"IEEE Trans Comput"},{"issue":"15","key":"7272_CR31","doi-asserted-by":"publisher","first-page":"2939","DOI":"10.1016\/j.dam.2007.12.005","volume":"156","author":"E Cheng","year":"2008","unstructured":"Cheng E, Lipman M, Lipt\u00e1k L (2008) Strong structural properties of unidirectional star graphs. Discret Appl Math 156(15):2939\u20132949","journal-title":"Discret Appl Math"},{"issue":"3","key":"7272_CR32","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/net.10045","volume":"40","author":"E Cheng","year":"2010","unstructured":"Cheng E, Lipman M (2010) Increasing the connectivity of the star graphs. Networks 40(3):165\u2013169","journal-title":"Networks"},{"issue":"12","key":"7272_CR33","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1080\/00207160701619200","volume":"85","author":"X Yang","year":"2008","unstructured":"Yang X, Megson GM, Tang YY, Xing Y (2008) Largest connected component of a star graph with faulty vertices. Int J Comput Math 85(12):1771\u20131778","journal-title":"Int J Comput Math"},{"issue":"7","key":"7272_CR34","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.1109\/TC.2013.64","volume":"63","author":"Q Zhu","year":"2014","unstructured":"Zhu Q, Guo G, Wang D (2014) Relating diagnosability, strong diagnosability and conditional diagnosability of strong networks. IEEE Trans Comput 63(7):1847\u20131851","journal-title":"IEEE Trans Comput"},{"issue":"6","key":"7272_CR35","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1109\/TDSC.2017.2726541","volume":"16","author":"L Lin","year":"2019","unstructured":"Lin L, Xu L, Chen R, Hsieh SY, Wang D (2019) Relating extra connectivity and extra conditional diagnosability in regular networks. IEEE Trans Dependable Secure Comput 16(6):1086\u20131097","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"3","key":"7272_CR36","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1109\/TR.2020.3013158","volume":"71","author":"L Lin","year":"2022","unstructured":"Lin L, Huang Y, Hsieh S-Y, Xu L (2022) Strong reliability of star graphs interconnection networks. IEEE Trans Reliab 71(3):1241\u20131254","journal-title":"IEEE Trans Reliab"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07272-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07272-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07272-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T12:16:14Z","timestamp":1746274574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07272-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,3]]},"references-count":36,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["7272"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07272-0","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,3]]},"assertion":[{"value":"30 March 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"820"}}