{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:18:12Z","timestamp":1759666692442,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272333","62172291"],"award-info":[{"award-number":["62272333","62172291"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Jiangsu Province Department of Education Future Network Research Fund Project","award":["FNSRFP-2021-YB-39"],"award-info":[{"award-number":["FNSRFP-2021-YB-39"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11227-023-05589-2","type":"journal-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T17:01:40Z","timestamp":1694106100000},"page":"3817-3848","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Connectivity and diagnosability of a class of recursive networks"],"prefix":"10.1007","volume":"80","author":[{"given":"Yaqian","family":"Tang","sequence":"first","affiliation":[]},{"given":"Baolei","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yuejuan","family":"Han","sequence":"additional","affiliation":[]},{"given":"Jia","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"5589_CR1","doi-asserted-by":"crossref","unstructured":"Guo C, Lu G, Li D, Wu H, Zhang X, Shi Y, Tian C, Zhang Y, Lu S (2009) BCube: a high performance, server-centric network architecture for modular data centers. In: Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, pp 63\u201374","DOI":"10.1145\/1592568.1592577"},{"issue":"1","key":"5589_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1093\/comjnl\/bxx057","volume":"61","author":"X Li","year":"2018","unstructured":"Li X, Fan J, Lin C-K, Jia X (2018) Diagnosability evaluation of the data center network DCell. Comput J 61(1):129\u2013143","journal-title":"Comput J"},{"issue":"5","key":"5589_CR3","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/TPDS.2018.2874659","volume":"30","author":"Z Zhang","year":"2018","unstructured":"Zhang Z, Deng Y, Min G, Xie J, Yang L-T, Zhou Y (2018) HSDC: a highly scalable data center network architecture for greater incremental scalability. IEEE Trans Parallel Distrib Syst 30(5):1105\u20131119","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5589_CR4","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s11390-018-1826-3","volume":"33","author":"X Wang","year":"2018","unstructured":"Wang X, Fan J, Lin C-K, Zhou J, Liu Z (2018) BCDC: a high-performance, server-centric data center network. J Comput Sci Technol 33:400\u2013416","journal-title":"J Comput Sci Technol"},{"key":"5589_CR5","doi-asserted-by":"crossref","unstructured":"Greenberg A, Hamilton JR, Jain N, Kandula S, Kim C, Lahiri P, Maltz DA, Patel P, Sengupta S (2009) VL2: a scalable and flexible data center network. In: Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, pp 51\u201362","DOI":"10.1145\/1592568.1592576"},{"issue":"2","key":"5589_CR6","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/TC.2005.33","volume":"54","author":"J Fan","year":"2005","unstructured":"Fan J, Lin X (2005) The $$t\/k$$-diagnosability of the BC graphs. IEEE Trans Comput 54(2):176\u2013184. https:\/\/doi.org\/10.1109\/TC.2005.33","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"5589_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/1851275.1851191","volume":"40","author":"HA Libdeh","year":"2010","unstructured":"Libdeh HA, Costa P, Rowstron A, O\u2019Shea G, Donnelly A (2010) Symbiotic routing in future data centers. ACM SIGCOMM Comput Commun Rev 40(4):51\u201362. https:\/\/doi.org\/10.1145\/1851275.1851191","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"1","key":"5589_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TPDS.2022.3217415","volume":"34","author":"H Zhang","year":"2022","unstructured":"Zhang H, Hao R-X, Qin X-W, Lin C-K, Hsieh S-Y (2022) The high faulty tolerant capability of the alternating group graphs. IEEE Trans Parallel Distrib Syst 34(1):225\u2013233","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5589_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.tcs.2019.01.020","volume":"776","author":"M Gu","year":"2019","unstructured":"Gu M, Hao R-X, Zhou S (2019) Fault diagnosability of data center networks. Theoret Comput Sci 776:138\u2013147","journal-title":"Theoret Comput Sci"},{"key":"5589_CR10","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPDS.2014.2318305","volume":"26","author":"J Yuan","year":"2015","unstructured":"Yuan J, Liu A, Ma X, Liu X, Qin X, Zhang J (2015) The $$g$$-good-neighbor conditional diagnosability of $$k$$-ary $$n$$-cubes under the PMC model and MM$$^{*}$$ model. IEEE Trans Parallel Distrib Syst 26:1165\u20131177","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"5589_CR11","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\u20133","key":"5589_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(92)00475-7","volume":"127","author":"J F\u00e0brega","year":"1994","unstructured":"F\u00e0brega J, Fiol MA (1994) Extraconnectivity of graphs with large girth. Discrete Math 127(1\u20133):163\u2013170","journal-title":"Discrete Math"},{"issue":"2","key":"5589_CR13","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/12.262126","volume":"43","author":"S Latifi","year":"1994","unstructured":"Latifi S, Hegde M, Naraghi-Pour M (1994) Conditional connectivity measures for large multiprocessor systems. IEEE Trans Comput 43(2):218\u2013222","journal-title":"IEEE Trans Comput"},{"key":"5589_CR14","volume":"436","author":"W-H Zhu","year":"2023","unstructured":"Zhu W-H, Hao R-X, Feng Y-Q, Lee J (2023) The 3-path-connectivity of the $$k$$-ary $$n$$-cube. Appl Math Comput 436:127499","journal-title":"Appl Math Comput"},{"key":"5589_CR15","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.dam.2021.08.022","volume":"305","author":"L Guo","year":"2021","unstructured":"Guo L, Ekinci G-B (2021) Super connectivity of folded twisted crossed cubes. Discrete Appl Math 305:56\u201363","journal-title":"Discrete Appl Math"},{"issue":"2","key":"5589_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1142\/S0129054121500076","volume":"32","author":"L Guo","year":"2021","unstructured":"Guo L, Zhang M, Zhai S, Xu L (2021) Relation of extra edge connectivity and component edge connectivity for regular networks. Int J Found Comput Sci 32(2):137\u2013149","journal-title":"Int J Found Comput Sci"},{"key":"5589_CR17","volume":"391","author":"X Li","year":"2021","unstructured":"Li X, Zhou S, Ren X, Guo X (2021) Structure and substructure connectivity of alternating group graphs. Appl Math Comput 391:125639","journal-title":"Appl Math Comput"},{"key":"5589_CR18","volume":"430","author":"N Wang","year":"2022","unstructured":"Wang N, Meng J, Tian Y (2022) Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern. Appl Math Comput 430:127257","journal-title":"Appl Math Comput"},{"key":"5589_CR19","volume":"363","author":"G Zhang","year":"2019","unstructured":"Zhang G, Wang D (2019) Structure connectivity and substructure connectivity of bubble-sort star graph networks. Appl Math Comput 363:124632","journal-title":"Appl Math Comput"},{"key":"5589_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.dam.2022.08.015","volume":"322","author":"W-H Zhu","year":"2022","unstructured":"Zhu W-H, Hao R-X, Li L (2022) The 3-path-connectivity of the hypercubes. Discrete Appl Math 322:203\u2013209","journal-title":"Discrete Appl Math"},{"key":"5589_CR21","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"6","author":"FP Preparata","year":"1967","unstructured":"Preparata FP, Metze G, Chien RT (1967) On the connection assignment problem of diagnosable systems. IEEE Trans Electron Comput 6:848\u2013854","journal-title":"IEEE Trans Electron Comput"},{"issue":"7","key":"5589_CR22","first-page":"1739","volume":"33","author":"L Lin","year":"2021","unstructured":"Lin L, Huang Y, Lin Y, Hsieh S-Y, Xu L (2021) Ffnlfd: fault diagnosis of multiprocessor systems at local node with fault-free neighbors under PMC model and MM$$^{*}$$ model. IEEE Trans Parallel Distrib Syst 33(7):1739\u20131751","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5589_CR23","unstructured":"Huang Y, Lin L, Lin Y, Xu L, Hsieh SY (2021) Fault diagnosability of networks with fault-free block at local vertex under MM$$^{*}$$ model. IEEE Trans Reliab"},{"key":"5589_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.dam.2022.11.012","volume":"327","author":"H Zhang","year":"2023","unstructured":"Zhang H, Zhou S, Cheng E (2023) Restricted connectivity of Cayley graph generated by transposition trees. Discrete Appl Math 327:87\u201395","journal-title":"Discrete Appl Math"},{"issue":"21","key":"5589_CR25","first-page":"10406","volume":"218","author":"S-L Peng","year":"2012","unstructured":"Peng S-L, Lin C-K, Tan JJ-M, Hsu L-H (2012) The $$g$$-good-neighbor conditional diagnosability of hypercube under PMC model. Appl Math Comput 218(21):10406\u201310412","journal-title":"Appl Math Comput"},{"issue":"3","key":"5589_CR26","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1080\/00207160.2015.1020796","volume":"93","author":"S Zhang","year":"2016","unstructured":"Zhang S, Yang W (2016) The $$g$$-extra conditional diagnosability and sequential $$t\/k$$-diagnosability of hypercubes. Int J Comput Math 93(3):482\u2013497","journal-title":"Int J Comput Math"},{"issue":"12","key":"5589_CR27","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1109\/TC.2004.114","volume":"53","author":"C-P Chang","year":"2004","unstructured":"Chang C-P, Lai P-L, Tan JJ-M, Hsu LH (2004) Diagnosability of $$t$$-connected networks and product networks under the comparison diagnosis model. IEEE Trans Comput 53(12):1582\u20131590","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"5589_CR28","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.akcej.2019.12.008","volume":"17","author":"Q Zhu","year":"2020","unstructured":"Zhu Q, Thulasiraman K, Xu M, Radhakrishnan S (2020) Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks. AKCE Int J Graphs Comb 17(3):755\u2013760","journal-title":"AKCE Int J Graphs Comb"},{"key":"5589_CR29","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2021.08.025","volume":"891","author":"Q Zhu","year":"2021","unstructured":"Zhu Q, Thulasiraman K, Naik K, Radhakrishnan S, Xu M (2021) Symmetric PMC model of diagnosis, $$b$$-matchings in graphs and fault identification in $$t$$-diagnosable systems. Theoret Comput Sci 891:35\u201349","journal-title":"Theoret Comput Sci"},{"issue":"6","key":"5589_CR30","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TC.1984.1676472","volume":"33","author":"AT Dahbura","year":"1984","unstructured":"Dahbura AT, Masson GM (1984) An $${O}(n^{2.5})$$ fault identification algorithm for diagnosable systems. IEEE Trans Comput 33(6):486\u2013492","journal-title":"IEEE Trans Comput"},{"key":"5589_CR31","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2020.04.011","volume":"824","author":"Y Wang","year":"2020","unstructured":"Wang Y, Lin C-K, Li X, Zhou S (2020) Diagnosability for two families of composition networks. Theoret Comput Sci 824:46\u201356","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"5589_CR32","doi-asserted-by":"publisher","first-page":"2783","DOI":"10.1007\/s11227-022-04768-x","volume":"79","author":"J-H Park","year":"2023","unstructured":"Park J-H, Lim H-S (2023) Characterization of interval graphs that are paired 2-disjoint path coverable. J Supercomput 79(3):2783\u20132800. https:\/\/doi.org\/10.1007\/s11227-022-04768-x","journal-title":"J Supercomput"},{"issue":"1","key":"5589_CR33","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2015.09.022","volume":"609","author":"X Wang","year":"2016","unstructured":"Wang X, Fan J, Jia X, Lin C-K (2016) An efficient algorithm to construct disjoint path covers of Dcell networks. Theoret Comput Sci 609(1):197\u2013210. https:\/\/doi.org\/10.1016\/j.tcs.2015.09.022","journal-title":"Theoret Comput Sci"},{"key":"5589_CR34","doi-asserted-by":"crossref","unstructured":"Cheng B, Wang D, Fan J (2023) Independent spanning trees in networks\u2014a survey. ACM Comput Surv","DOI":"10.1145\/3591110"},{"issue":"6","key":"5589_CR35","doi-asserted-by":"publisher","first-page":"4557","DOI":"10.1007\/s10462-021-10111-2","volume":"55","author":"S Poulik","year":"2022","unstructured":"Poulik S, Ghorai G (2022) Estimation of most effected cycles and busiest network route based on complexity function of graph in fuzzy environment. Artif Intell Rev 55(6):4557\u20134574. https:\/\/doi.org\/10.1007\/s10462-021-10111-2","journal-title":"Artif Intell Rev"},{"key":"5589_CR36","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.fss.2018.06.007","volume":"360","author":"M Binu","year":"2019","unstructured":"Binu M, Mathew S, Mordeson JN (2019) Connectivity index of a fuzzy graph and its application to human trafficking. Fuzzy Sets Syst 360:117\u2013136. https:\/\/doi.org\/10.1016\/j.fss.2018.06.007","journal-title":"Fuzzy Sets Syst"},{"key":"5589_CR37","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.ins.2020.09.050","volume":"545","author":"S Poulik","year":"2021","unstructured":"Poulik S, Ghorai G (2021) Determination of journeys order based on graph\u2019s wiener absolute index with bipolar fuzzy information. Inform Sci 545:608\u2013619. https:\/\/doi.org\/10.1016\/j.ins.2020.09.050","journal-title":"Inform Sci"},{"issue":"2","key":"5589_CR38","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1007\/s40747-021-00580-x","volume":"8","author":"S Poulik","year":"2022","unstructured":"Poulik S, Ghorai G (2022) Applications of graph\u2019s complete degree with bipolar fuzzy information. Complex Intell Syst 8(2):1115\u20131127. https:\/\/doi.org\/10.1007\/s40747-021-00580-x","journal-title":"Complex Intell Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05589-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05589-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05589-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T11:13:54Z","timestamp":1705922034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05589-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,7]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["5589"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05589-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2023,9,7]]},"assertion":[{"value":"9 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2023","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 they have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The submitted work is original and is not published elsewhere in any form or language. the results\/data\/figures in this manuscript have not been published elsewhere, nor are they under consideration by another publisher.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}