{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T02:20:00Z","timestamp":1780626000874,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:00:00Z","timestamp":1733270400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:00:00Z","timestamp":1733270400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2023A1515011049"],"award-info":[{"award-number":["2023A1515011049"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]}],"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-06702-9","type":"journal-article","created":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T12:44:53Z","timestamp":1733316293000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The 3-path-connectivity of pancake graphs"],"prefix":"10.1007","volume":"81","author":[{"given":"Jiaqi","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongqin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,4]]},"reference":[{"key":"6702_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, London"},{"key":"6702_CR2","doi-asserted-by":"crossref","unstructured":"Whitney H (1992) Congruent graphs and the connectivity of graphs. Hassler Whitney Collected Papers, pp 61\u201379","DOI":"10.1007\/978-1-4612-2972-8_4"},{"key":"6702_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.dam.2022.11.020","volume":"327","author":"S-L Zhao","year":"2023","unstructured":"Zhao S-L, Chang J-M, Li H-Z (2023) The generalized 4-connectivity of pancake graphs. Discrete Appl Math 327:77\u201386","journal-title":"Discrete Appl Math"},{"issue":"1\u20132","key":"6702_CR4","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(1\u20132):53\u201359","journal-title":"Discrete Math"},{"key":"6702_CR5","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":"6702_CR6","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 (2016) Generalized Connectivity of Graphs. Springer, Heidelberg"},{"issue":"2","key":"6702_CR7","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(2):179\u2013189","journal-title":"J Combin Theory Ser B"},{"issue":"1","key":"6702_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"WH Gates","year":"1979","unstructured":"Gates WH, Papadimitriou CH (1979) Bounds for sorting by prefix reversal. Discrete Math 27(1):47\u201357","journal-title":"Discrete Math"},{"key":"6702_CR9","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":"6702_CR10","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 minimally 2-connected graphs with generalized connectivity $$\\kappa _3=2$$. J Combin Optim 34:141\u2013164","journal-title":"J Combin Optim"},{"key":"6702_CR11","first-page":"882","volume":"347","author":"S Li","year":"2019","unstructured":"Li S, Zhao Y, Li F, Gu R (2019) The generalized 3-connectivity of the mycielskian of a graph. Appl Math Comput 347:882\u2013890","journal-title":"Appl Math Comput"},{"key":"6702_CR12","first-page":"645","volume":"347","author":"Y Li","year":"2019","unstructured":"Li Y, Gu R, Lei H (2019) The generalized connectivity of the line graph and the total graph for the complete bipartite graph. Appl Math Comput 347:645\u2013652","journal-title":"Appl Math Comput"},{"issue":"1","key":"6702_CR13","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(1):27\u201339","journal-title":"Int J Comput Math"},{"key":"6702_CR14","first-page":"215","volume":"357","author":"L Li","year":"2024","unstructured":"Li L, Hao R-X, Zhu W-H (2024) The 3-path-connectivity of the star graphs. Appl Math Comput 357:215\u2013235","journal-title":"Appl Math Comput"},{"key":"6702_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 Combin 37:2521\u20132533","journal-title":"Graphs Combin"},{"issue":"4","key":"6702_CR16","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":"1","key":"6702_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comjnl\/bxz116","volume":"64","author":"S-L Zhao","year":"2021","unstructured":"Zhao S-L, Hao R-X, Peng S-L (2021) Reliability assessment of some regular networks. Comput J 64(1):1\u20136","journal-title":"Comput J"},{"issue":"15\u201316","key":"6702_CR18","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 (2010) Sharp bounds for the generalized connectivity $$\\kappa _{3}(g)$$. Discrete Math 310(15\u201316):2147\u20132163","journal-title":"Discrete Math"},{"key":"6702_CR19","doi-asserted-by":"crossref","unstructured":"Sawada N, Kaneko K, Peng S (2007) Pairwise disjoint paths in pancake graphs. In: Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), pp 376\u2013382. IEEE","DOI":"10.1109\/PDCAT.2007.85"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06702-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06702-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06702-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T13:04:20Z","timestamp":1733317460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06702-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,4]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6702"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06702-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,4]]},"assertion":[{"value":"8 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 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":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"245"}}