{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T20:41:41Z","timestamp":1768596101829,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T00:00:00Z","timestamp":1711065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T00:00:00Z","timestamp":1711065600000},"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 Science Foundation of China","doi-asserted-by":"crossref","award":["12261074"],"award-info":[{"award-number":["12261074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["12201335"],"award-info":[{"award-number":["12201335"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12190-024-02013-7","type":"journal-article","created":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T19:02:27Z","timestamp":1711134147000},"page":"2097-2114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The 4-set tree connectivity of hierarchical folded hypercube"],"prefix":"10.1007","volume":"70","author":[{"given":"Junzhen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyu","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shumin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,22]]},"reference":[{"key":"2013_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.: Graph Theory. Springer, New York (2008)"},{"key":"2013_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and connectivity of graphs. J. Am. Math. Soc. 54, 150\u2013168 (1932)","journal-title":"J. Am. Math. Soc."},{"key":"2013_CR3","first-page":"1","volume":"2","author":"G Chartrand","year":"1984","unstructured":"Chartrand, G., Kappor, S., Lesniak, L.: Generalized connectivity in graphs. Bombay Math. 2, 1\u20136 (1984)","journal-title":"Bombay Math."},{"issue":"6","key":"2013_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0020-0190(92)90230-S","volume":"42","author":"S Khuller","year":"1992","unstructured":"Khuller, S., Schieber, B.: On independent spanning trees. Inf. Process. Lett. 42(6), 321\u2013323 (1992)","journal-title":"Inf. Process. Lett."},{"key":"2013_CR5","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1145\/3591110","volume":"56","author":"B Cheng","year":"2023","unstructured":"Cheng, B., Wang, D., Fan, J.: Independent spanning trees in networks\u2013a survey. ACM. Comput. Surv. 56, 678 (2023). https:\/\/doi.org\/10.1145\/3591110","journal-title":"ACM. Comput. Surv."},{"key":"2013_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2017.01.016","volume":"670","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Shen, H., Fan, J.: Edge-independent spanning trees in augmented cubes. Theor. Comput. Sci. 670, 23\u201332 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"2013_CR7","first-page":"193","volume":"114","author":"H Li","year":"2014","unstructured":"Li, H., Li, X., Mao, Y., Sun, Y.: Note on the generalized connectivity. Ars. Combin. 114, 193\u2013202 (2014)","journal-title":"Ars. Combin."},{"key":"2013_CR8","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.disc.2010.04.011","volume":"310","author":"S Li","year":"2010","unstructured":"Li, S., Li, X., Zhou, W.: Sharp bounds for the generalized connectivity. Discret. Math. 310, 2147\u20132163 (2010)","journal-title":"Discret. Math."},{"key":"2013_CR9","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1016\/j.disc.2018.03.021","volume":"341","author":"H Li","year":"2018","unstructured":"Li, H., Wu, B., Meng, J., Mao, Y.: Steiner tree packing number and tree connectivity. Discrete. Math. 341, 1945\u20131951 (2018)","journal-title":"Discrete. Math."},{"key":"2013_CR10","first-page":"360","volume":"55","author":"G Chartrand","year":"2010","unstructured":"Chartrand, G., Okamoto, F., Zhang, P.: Rainbow trees in graphs and generalized connectivity. Networks 55, 360\u2013367 (2010)","journal-title":"Networks"},{"key":"2013_CR11","first-page":"43","volume":"14","author":"H Li","year":"2012","unstructured":"Li, H., Li, X., Sun, Y.: The generalized $$3$$-connectivity of Cartesian product graphs. Discret. Math. Theor. Comput. Sci. 14, 43\u201354 (2012)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"2013_CR12","first-page":"77","volume":"295","author":"H Li","year":"2017","unstructured":"Li, H., Ma, Y., Yang, W., Wang, Y.: The generalized $$3$$-connectivity of graph products. Appl. Math. Comput. 295, 77\u201383 (2017)","journal-title":"Appl. Math. Comput."},{"key":"2013_CR13","first-page":"65","volume":"104","author":"S Li","year":"2012","unstructured":"Li, S., Li, W., Li, X.: The generalized connectivity of complete bipartite graphs. Ars. Combin. 104, 65\u201379 (2012)","journal-title":"Ars. Combin."},{"key":"2013_CR14","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.dam.2018.05.059","volume":"251","author":"S Zhao","year":"2018","unstructured":"Zhao, S., Hao, R.: The generalized connectivity of alternating group graphs and $$(n, k)$$-star graphs. Discret. Appl. Math. 251, 310\u2013321 (2018)","journal-title":"Discret. Appl. Math."},{"key":"2013_CR15","first-page":"42","volume":"27","author":"J Wang","year":"2022","unstructured":"Wang, J., Zhang, S., Ge, H.: The generalized $$3$$-connectivity of folded hypercubes. J. Shandong Univ. 27, 42\u201349 (2022)","journal-title":"J. Shandong Univ."},{"key":"2013_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.dam.2016.12.003","volume":"220","author":"S Lin","year":"2017","unstructured":"Lin, S., Zhang, Q.: The generalized $$4$$-connectivity of hypercubes. Discret. Appl. Math. 220, 60\u201367 (2017)","journal-title":"Discret. Appl. Math."},{"key":"2013_CR17","first-page":"342","volume":"347","author":"S Zhao","year":"2019","unstructured":"Zhao, S., Hao, R.: The generalized $$4$$-connectivity of exchanged hypercubes. Appl. Math. Comput. 347, 342\u2013353 (2019)","journal-title":"Appl. Math. Comput."},{"key":"2013_CR18","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2018.09.025","volume":"257","author":"S Zhao","year":"2019","unstructured":"Zhao, S., Hao, R., Cheng, E.: Two kinds of generalized connectivity of dual cubes. Discret. Appl. Math. 257, 306\u2013316 (2019)","journal-title":"Discret. Appl. Math."},{"key":"2013_CR19","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.dam.2020.09.026","volume":"289","author":"S Zhao","year":"2021","unstructured":"Zhao, S., Hao, R., Wu, J.: The generalized $$4$$-connectivity of hierarchical cubic networks. Discret. Appl. Math. 289, 194\u2013206 (2021)","journal-title":"Discret. Appl. Math."},{"key":"2013_CR20","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1515\/math-2022-0490","volume":"20","author":"J Wang","year":"2022","unstructured":"Wang, J., Zou, J., Zhang, S.: Generalized $$4$$-connectivity of hierarchical star networks. Open. Math. 20, 1261\u20131275 (2022)","journal-title":"Open. Math."},{"key":"2013_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33828-6","volume-title":"Generalized Connectivity of Graphs","author":"X Li","year":"2016","unstructured":"Li, X., Mao, Y.: Generalized Connectivity of Graphs. Springer, Cham (2016)"},{"key":"2013_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10878-015-9956-9","volume":"33","author":"Y Sun","year":"2017","unstructured":"Sun, Y., Li, X.: On the difference of two generalized connectivities of a graph. J. Combin. Optim. 33, 283\u2013291 (2017)","journal-title":"J. Combin. Optim."},{"key":"2013_CR23","first-page":"245","volume":"38","author":"Y Sun","year":"2018","unstructured":"Sun, Y., Li, F., Jin, Z.: On two generalized connectivities of graphs. Discret. Math. Theory 38, 245\u2013261 (2018)","journal-title":"Discret. Math. Theory"},{"issue":"11","key":"2013_CR24","first-page":"43","volume":"14","author":"X Li","year":"2012","unstructured":"Li, X., Mao, Y.: A survey on the generalized connectivity of graphs. Comput. Sci. 14(11), 43\u201354 (2012)","journal-title":"Comput. Sci."},{"key":"2013_CR25","first-page":"41","volume":"274","author":"S Li","year":"2016","unstructured":"Li, S., Tu, J., Yu, C.: The generalized $$3$$-connectivity of star graphs and bubble-sort graphs. Appl. Math. Comput. 274, 41\u201346 (2016)","journal-title":"Appl. Math. Comput."},{"key":"2013_CR26","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2020.08.004","volume":"844","author":"C Li","year":"2020","unstructured":"Li, C., Lin, S., Li, S.: The $$4$$-set tree connectivity of $$(n, k)$$-star networks. Theor. Comput. Sci. 844, 81\u201386 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"2013_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/71.80187","volume":"2","author":"A El-Amawy","year":"1991","unstructured":"El-Amawy, A., Latifi, S.: Properties and performance of folded hypercubes. IEEE Trans. Parallel Distrib. Syst. 2, 31\u201342 (1991)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2013_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2019.04.022","volume":"790","author":"X Sun","year":"2019","unstructured":"Sun, X., Dong, Q., Zhou, S.: Fault tolerance analysis of hierarchical folded cube. Theor. Comput. Sci. 790, 117\u2013130 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"2013_CR29","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1080\/23799927.2022.2123405","volume":"7","author":"H Li","year":"2022","unstructured":"Li, H., Cheng, D.: The generalized $$4$$-connectivty of folded hypercube. Int. J. Comput. Math. Comput. Syst. Theory 7, 235\u2013245 (2022)","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"2013_CR30","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2021.06.001","volume":"883","author":"X Sun","year":"2021","unstructured":"Sun, X., Fan, J., Cheng, B., Liu, Z., Yu, J.: Component conditional fault tolerance of hierarchical folded cubic networks. Theor. Comput. Sci. 883, 44\u201358 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"2013_CR31","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1093\/comjnl\/bxz136","volume":"64","author":"X Li","year":"2021","unstructured":"Li, X., Lin, C., Fan, J., Jia, X., Cheng, B., Zhou, J.: Relationship between extra connectivity and component connectivity in networks. Comput. J. 64, 38\u201353 (2021)","journal-title":"Comput. J."},{"key":"2013_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11227-023-05095-5","volume":"79","author":"R Guo","year":"2023","unstructured":"Guo, R., Wang, Y., Fan, J., Fan, W.: Embedding hierarchical folded cubes into linear arrays and complete binary trees with minimum wirelength. J. Supercomput. 79, 1\u201328 (2023)","journal-title":"J. Supercomput."},{"key":"2013_CR33","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054123500156","author":"H Lin","year":"2023","unstructured":"Lin, H., Tang, S., Pai, K., Chang, J.: A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks. Int. J. Found. Comput. Sci. (2023). https:\/\/doi.org\/10.1142\/S0129054123500156","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02013-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02013-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02013-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T13:37:04Z","timestamp":1717162624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02013-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,22]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2013"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02013-7","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,22]]},"assertion":[{"value":"31 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}