{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:47:04Z","timestamp":1784213224726,"version":"3.55.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"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":"crossref","award":["12471321, 12331013, 12161141005"],"award-info":[{"award-number":["12471321, 12331013, 12161141005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2022JBCG003"],"award-info":[{"award-number":["2022JBCG003"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education","award":["2021K2A9A2A11101586"],"award-info":[{"award-number":["2021K2A9A2A11101586"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11227-024-06545-4","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T06:10:31Z","timestamp":1732601431000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Packing internally disjoint Steiner paths of data center networks"],"prefix":"10.1007","volume":"81","author":[{"given":"Wen-Han","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong-Xia","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jaeun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"key":"6545_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph Theory. Springer, Berlin"},{"key":"6545_CR2","first-page":"1","volume":"2","author":"G Chartrand","year":"1984","unstructured":"Chartrand G, Kapoor SF, Lesniak L, Lick DR (1984) Generalized connectivity in graphs. Bombay Math 2:1\u20136","journal-title":"Bombay Math"},{"key":"6545_CR3","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TPDS.2020.3029654","volume":"32","author":"G Chen","year":"2021","unstructured":"Chen G, Cheng B, Wang D (2021) Constructing completely independent spanning trees in data center network based on augmented cube. IEEE Trans Parallel Distrib Syst 32:665\u2013673","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"6545_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/mana.19600220107","volume":"22","author":"GA Dirac","year":"1960","unstructured":"Dirac GA (1960) In abstrakten graphen vorhandene vollst$$\\ddot{a}$$ndige $$4$$-graphen und ihre unterteilungen. Math Nach 22:61\u201385","journal-title":"Math Nach"},{"key":"6545_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ipl.2018.02.009","volume":"134","author":"M-M Gu","year":"2018","unstructured":"Gu M-M, Hao R-X, Liu J-B (2018) The pessimistic diagnosability of data center networks. Inf Process Lett 134:52\u201356","journal-title":"Inf Process Lett"},{"key":"6545_CR6","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: Special Interest Group on Data Communication (SIGCOMM), pp 63\u201374","DOI":"10.1145\/1594977.1592577"},{"key":"6545_CR7","doi-asserted-by":"crossref","unstructured":"Guo C, Wu H, Tan K, Shi L, Zhang Y, Lu S (2008) DCell: a scalable and fault-tolerant network structure for data centers. In: Proceedings of Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Seattle, pp 75\u201386","DOI":"10.1145\/1402958.1402968"},{"key":"6545_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0095-8956(85)90083-8","volume":"38","author":"M Hager","year":"1985","unstructured":"Hager M (1985) Pendant tree-connectivity. J Combin Theory Ser B 38:179\u2013189","journal-title":"J Combin Theory Ser B"},{"key":"6545_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(86)90068-3","volume":"59","author":"M Hager","year":"1986","unstructured":"Hager M (1986) Path-connectivity in graphs. Discrete Math 59:53\u201359","journal-title":"Discrete Math"},{"key":"6545_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2020.11.027","volume":"855","author":"R-X Hao","year":"2021","unstructured":"Hao R-X, Tian Z (2021) The vertex-pancyclicity of data center networks. Theoret Comput Sci 855:74\u201389","journal-title":"Theoret Comput Sci"},{"key":"6545_CR11","doi-asserted-by":"crossref","unstructured":"Kliegl M, Lee J, Li J, Zhang X, Guo C, Rincn D (2010) Generalized DCell structure for load-balanced data center networks. In: Proceedings of the IEEE INFOCOM, San Diego, pp 1\u20135","DOI":"10.1109\/INFCOMW.2010.5466647"},{"key":"6545_CR12","doi-asserted-by":"crossref","unstructured":"Li D, Guo C, Wu H, Tan K, Zhang Y, Lu S (2009) Ficonn: Using backup port for server interconnection in data centers. In: International Conference on Computer Communications (INFOCOM), pp 2276\u20132285","DOI":"10.1109\/INFCOM.2009.5062153"},{"key":"6545_CR13","first-page":"77","volume":"295","author":"H Li","year":"2017","unstructured":"Li H, Ma Y, Yang W, Wang Y (2017) The generalized $$3$$-connectivity of graph products. Appl Math Comput 295:77\u201383","journal-title":"Appl Math Comput"},{"key":"6545_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10878-016-0075-z","volume":"34","author":"S Li","year":"2017","unstructured":"Li S, Li W, Shi Y, Sun H (2017) On the mininmally $$2$$-connected graphs with generalized connectivity $$\\kappa _{3}=2$$. J Comb Optim 34:141\u2013164","journal-title":"J Comb Optim"},{"key":"6545_CR15","doi-asserted-by":"publisher","first-page":"2521","DOI":"10.1007\/s00373-021-02376-9","volume":"37","author":"S Li","year":"2021","unstructured":"Li S, Qin Z, Tu J, Yue J (2021) On tree-connectivity and path-connectivity of graphs. Graphs Comb 37:2521\u20132533","journal-title":"Graphs Comb"},{"key":"6545_CR16","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1109\/TPDS.2021.3133595","volume":"33","author":"X Li","year":"2022","unstructured":"Li X, Lin W, Liu X, Lin C, Pai K, Chang J (2022) Completely independent spanning trees on BCCC data center networks with an application to fault-tolerant routing. IEEE Trans Parallel Distrib Syst 33:1939\u20131952","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"6545_CR17","doi-asserted-by":"crossref","unstructured":"Libdeh H, Costa P, Rowstron A, OShea G, Donnelly A (2010) Symbiotic routing in future data centers. In: Special Interest Group on Data Communication (SIGCOMM), pp 51\u201362","DOI":"10.1145\/1851182.1851191"},{"key":"6545_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207160.2014.987762","volume":"93","author":"Y Mao","year":"2016","unstructured":"Mao Y (2016) Path-connectivity of lexicographic product graphs. Int J Comput Math 93:27\u201339","journal-title":"Int J Comput Math"},{"key":"6545_CR19","doi-asserted-by":"publisher","first-page":"2172","DOI":"10.1109\/LCOMM.2013.091913.131176","volume":"17","author":"M Manzano","year":"2013","unstructured":"Manzano M, Bilal K, Calle E, Khan SU (2013) On the connectivity of data center networks. IEEE Commun Lett 17:2172\u20132175","journal-title":"IEEE Commun Lett"},{"key":"6545_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.dam.2018.03.049","volume":"247","author":"X-W Qin","year":"2018","unstructured":"Qin X-W, Hao R-X (2018) Conditional edge-fault-tolerant hamiltonicity of the data center network. Discret Appl Math 247:165\u2013179","journal-title":"Discret Appl Math"},{"key":"6545_CR21","doi-asserted-by":"publisher","first-page":"2944","DOI":"10.1093\/comjnl\/bxv019","volume":"58","author":"X Wang","year":"2015","unstructured":"Wang X, Erickson A, Fan J, Jia X (2015) Hamiltonian properties of DCell networks. Comput J 58:2944\u20132955","journal-title":"Comput J"},{"key":"6545_CR22","doi-asserted-by":"crossref","unstructured":"Wang X, Fan J, Cheng B, Liu W, Wang Y (2013) One-to-one disjoint path covers in DCell. In: IFIP International Conference on Network and Parallel Computing (NPC), pp 61\u201370","DOI":"10.1007\/978-3-642-40820-5_6"},{"key":"6545_CR23","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.dam.2015.09.002","volume":"203","author":"X Wang","year":"2016","unstructured":"Wang X, Fan J, Zhou J, Lin C-K (2016) The restricted $$h$$-connectivity of the data center network DCell. Discret Appl Math 203:144\u2013157","journal-title":"Discret Appl Math"},{"key":"6545_CR24","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney H (1932) Congruent graphs and the connectivity of graphs. Am J Math 54:150\u2013168","journal-title":"Am J Math"},{"key":"6545_CR25","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1142\/S0129054119500229","volume":"30","author":"S-L Zhao","year":"2019","unstructured":"Zhao S-L, Hao R-X (2019) The generalized connectivity of bubble-sort star graphs. Int J Found Comput Sci 30:793\u2013809","journal-title":"Int J Found Comput Sci"},{"key":"6545_CR26","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. Discret Appl Math 322:203\u2013209","journal-title":"Discret Appl Math"},{"key":"6545_CR27","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":"6545_CR28","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.dam.2024.07.032","volume":"358","author":"W-H Zhu","year":"2024","unstructured":"Zhu W-H, Hao R-X, Pai K-J, Cheng E (2024) Reliability analysis of exchanged hypercubes based on the path connectivity. Discret Appl Math 358:404\u2013416","journal-title":"Discret Appl Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06545-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06545-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06545-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T08:33:33Z","timestamp":1732610013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06545-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6545"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06545-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"14 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"211"}}