{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:04:10Z","timestamp":1771142650011,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T00:00:00Z","timestamp":1771113600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T00:00:00Z","timestamp":1771113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Henan Province, China","doi-asserted-by":"crossref","award":["252300420378, 252300421489"],"award-info":[{"award-number":["252300420378, 252300421489"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Postgraduate Education Reform and Quality Improvement Project of Henan Province","award":["YJS2024KC32"],"award-info":[{"award-number":["YJS2024KC32"]}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["252300420378"],"award-info":[{"award-number":["252300420378"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08310-1","type":"journal-article","created":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T07:17:12Z","timestamp":1771139832000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Restricted arc connectivity of unidirectional Cayley graphs generated by transposition trees"],"prefix":"10.1007","volume":"82","author":[{"given":"Xiaohui","family":"Hua","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,15]]},"reference":[{"key":"8310_CR1","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:555\u2013565","journal-title":"IEEE Trans Comput"},{"issue":"9","key":"8310_CR2","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1016\/j.dam.2012.02.006","volume":"160","author":"C Balbuena","year":"2012","unstructured":"Balbuena C, Garc\u00eda-V\u00e1zquez P, Hansberg A, Montejano LP (2012) Restricted arc connectivity of generalized p-cycles. Discrete Appl Math 160(9):1325\u20131332","journal-title":"Discrete Appl Math"},{"issue":"1","key":"8310_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1002\/net.21462","volume":"61","author":"C Balbuena","year":"2013","unstructured":"Balbuena C, Garc\u00eda-V\u00e1zquez P, Hansberg A, Montejano LP (2013) On the super-restricted arc connectivity of s-geodetic digraphs. Networks 61(1):20\u201328","journal-title":"Networks"},{"key":"8310_CR4","doi-asserted-by":"crossref","unstructured":"Balbuena C, Garc\u00eda-V\u00e1zquez P (2010) On the restricted arc connectivity of s-geodetic digraphs, Acta Math. Sin. (Engl. Ser.)61(10) 1865-1876","DOI":"10.1007\/s10114-010-9313-y"},{"issue":"3","key":"8310_CR5","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TR.1986.4335424","volume":"35","author":"FT Boesch","year":"1986","unstructured":"Boesch FT (1986) Synthesis of reliable networks - a survey. IEEE Trans Reliab 35(3):240\u2013246","journal-title":"IEEE Trans Reliab"},{"key":"8310_CR6","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. Discrete Appl Math 156:2939\u20132949","journal-title":"Discrete Appl Math"},{"issue":"21\u201322","key":"8310_CR7","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1016\/j.ipl.2009.08.005","volume":"109","author":"X Chen","year":"2009","unstructured":"Chen X, Liu J, Meng J (2009) The restricted arc connectivity of cartesian product digraphs. Inform Process Lett 109(21\u201322):1202\u20131205","journal-title":"Inform Process Lett"},{"key":"8310_CR8","doi-asserted-by":"publisher","first-page":"2662","DOI":"10.1016\/j.camwa.2007.10.016","volume":"55","author":"E Cheng","year":"2008","unstructured":"Cheng E, Lipt\u00e1k L, Shawash N (2008) Orienting Cayley graphs generated by transposition trees. Comput Math Appl 55:2662\u20132672","journal-title":"Comput Math Appl"},{"key":"8310_CR9","first-page":"167","volume":"199","author":"E Cheng","year":"2009","unstructured":"Cheng E, Lipt\u00e1k L (2009) A kind of conditional vertex connectivity of Cayley graphs generated by transposition trees. Congr Numer 199:167\u2013173","journal-title":"Congr Numer"},{"issue":"4","key":"8310_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"AH Esfahanian","year":"1988","unstructured":"Esfahanian AH, Hakimi SL (1988) On computing a conditional edge-connectivity of a graph. Inform Process Lett 27(4):195\u2013199","journal-title":"Inform Process Lett"},{"issue":"3","key":"8310_CR11","first-page":"1","volume":"70","author":"D Gonz\u00e1lez-Moreno","year":"2017","unstructured":"Gonz\u00e1lez-Moreno D, Ortiz RH (2017) A note on the restricted arc connectivity of oriented graphs of girth four. Australas J Combin 70(3):1\u201312","journal-title":"Australas J Combin"},{"issue":"13\u201314","key":"8310_CR12","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.dam.2013.01.028","volume":"161","author":"S Gr\u00fcter","year":"2013","unstructured":"Gr\u00fcter S, Guo Y, Holtkamp A (2013) Restricted arc connectivity of bipartite tournaments. Discrete Appl Math 161(13\u201314):2008\u20132013","journal-title":"Discrete Appl Math"},{"issue":"10\u201311","key":"8310_CR13","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1016\/j.dam.2013.02.010","volume":"161","author":"S Gr\u00fcter","year":"2013","unstructured":"Gr\u00fcter S, Guo Y, Holtkamp A, Ulmer E (2013) Restricted arc connectivity in tournaments. Discrete Appl Math 161(10\u201311):1467\u20131471","journal-title":"Discrete Appl Math"},{"key":"8310_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.dam.2017.12.040","volume":"244","author":"MM Gu","year":"2018","unstructured":"Gu MM, Hao RX (2018) Reliability analysis of Cayley graphs generated by transpositions. Discrete Appl Math 244:94\u2013102","journal-title":"Discrete Appl Math"},{"issue":"15","key":"8310_CR15","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1016\/j.disc.2007.06.035","volume":"308","author":"A Hellwig","year":"2008","unstructured":"Hellwig A, Volkmann L (2008) Maximally edge-connected and vertex-connected graphs and digraphs: a survey. Discrete Math 308(15):3265\u20133296","journal-title":"Discrete Math"},{"key":"8310_CR16","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.ipl.2018.02.014","volume":"134","author":"S Lin","year":"2018","unstructured":"Lin S, Li C, Jin Y (2018) Cartesian product digraphs with optimal restricted arc connectivity. Inform Process Lett 134:72\u201375","journal-title":"Inform Process Lett"},{"issue":"3","key":"8310_CR17","first-page":"529","volume":"23","author":"S Lin","year":"2018","unstructured":"Lin S, Fan N (2018) Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes. Taiwanese J Math 23(3):529\u2013543","journal-title":"Taiwanese J Math"},{"issue":"1","key":"8310_CR18","first-page":"2142013","volume":"22","author":"S Lin","year":"2022","unstructured":"Lin S, Shi R, Wu S (2022) Neighborhood conditions for super-$$\\lambda ^{\\prime }$$ digraphs. Internat J Found Comput Sci 22(1):2142013","journal-title":"Internat J Found Comput Sci"},{"key":"8310_CR19","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1016\/j.disc.2017.05.004","volume":"340","author":"S Lin","year":"2017","unstructured":"Lin S, Jin Y, Li C (2017) 3-Restricted arc connectivity of digraphs. Discrete Math 340:2341\u20132348","journal-title":"Discrete Math"},{"issue":"40","key":"8310_CR20","first-page":"269","volume":"40","author":"D Meierling","year":"2008","unstructured":"Meierling D, Volkmann L, Winzen S (2008) Restricted arc connectivity of generalized tournaments. Australas J Combin 40(40):269\u2013278","journal-title":"Australas J Combin"},{"key":"8310_CR21","doi-asserted-by":"publisher","first-page":"4398","DOI":"10.1007\/s11227-022-04837-1","volume":"79","author":"KG Pan","year":"2023","unstructured":"Pan KG, Cheng DQ (2023) Star structure connectivity of Cayley graphs generated by transposition trees. J Supercomput 79:4398\u20134411","journal-title":"J Supercomput"},{"key":"8310_CR22","first-page":"115","volume":"14","author":"M Tchuente","year":"1982","unstructured":"Tchuente M (1982) Generation of permutations by graphical exchanges. Ars Combin 14:115\u2013122","journal-title":"Ars Combin"},{"issue":"6","key":"8310_CR23","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ipl.2007.04.004","volume":"103","author":"L Volkmann","year":"2007","unstructured":"Volkmann L (2007) Restricted arc connectivity of digraphs. Inform Process Lett 103(6):234\u2013239","journal-title":"Inform Process Lett"},{"issue":"6","key":"8310_CR24","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.ipl.2008.07.008","volume":"108","author":"S Wang","year":"2008","unstructured":"Wang S, Lin S (2008) $$\\lambda ^{\\prime }$$-optimal digraphs. Inform Process Lett 108(6):386\u2013389","journal-title":"Inform Process Lett"},{"issue":"4","key":"8310_CR25","doi-asserted-by":"publisher","first-page":"661","DOI":"10.11650\/twjm\/1500407889","volume":"9","author":"J Xu","year":"2005","unstructured":"Xu J, Min L (2005) On restricted arc connectivity of regular digraphs. Taiwanese J Math 9(4):661\u2013670","journal-title":"Taiwanese J Math"},{"key":"8310_CR26","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.dam.2023.12.010","volume":"345","author":"X Zhao","year":"2024","unstructured":"Zhao X, Deng Q, Wang Z (2024) Restricted arc connectivity of unidirectional star graphs. Discrete Appl Math 345:207\u2013214","journal-title":"Discrete Appl Math"},{"key":"8310_CR27","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"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08310-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08310-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08310-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T07:17:14Z","timestamp":1771139834000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08310-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,15]]},"references-count":27,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["8310"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08310-1","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,15]]},"assertion":[{"value":"28 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2026","order":3,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"168"}}