{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:09:30Z","timestamp":1766578170205,"version":"3.48.0"},"reference-count":31,"publisher":"Oxford University Press (OUP)","issue":"12","license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Middle-aged and Young Research Fund of Qinghai Normal University","award":["2025QZR11"],"award-info":[{"award-number":["2025QZR11"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["12261074"],"award-info":[{"award-number":["12261074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["12461065"],"award-info":[{"award-number":["12461065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,24]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The generalizations of the connectivity and diagnosability are significant parameters to evaluate the reliability and the fault-tolerance of multiprocessor systems, and play an important role in designing and maintaining multiprocessor systems. In order to better measure the reliability of a system, some scholars proposed the cyclic connectivity and cyclic diagnosability, which request that there are at least two components containing cycles after removing the vertex set. Interconnection networks are typically used as the underlying topologies of a multiprocessor system. In particular, alternating group graphs possess many attractive properties, such as vertex transitivity, strong hierarchy, and maximal connectivity, making them excellent choices for interconnection networks in a multiprocessor system. In this paper, we determine that the cyclic connectivity of the alternating group graph is $6n-18$ for $n\\ge 4$. Moreover, we establish that its cyclic diagnosability is $8n-24$ for $n&amp;gt;6$ under the $PMC$ model and $MM^{*}$ model, respectively.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf085","type":"journal-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T14:16:20Z","timestamp":1752502580000},"page":"1938-1948","source":"Crossref","is-referenced-by-count":0,"title":["Cyclic connectivity and cyclic diagnosability of alternating group graphs"],"prefix":"10.1093","volume":"68","author":[{"given":"Ting","family":"Tian","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Normal University , No. 38, Wusi West Road, Chengxi District, Xining, 810008, Qinghai ,","place":["China"]}]},{"given":"Shumin","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Normal University , No. 38, Wusi West Road, Chengxi District, Xining, 810008, Qinghai ,","place":["China"]},{"name":"Academy of Plateau Science and Sustainability, People\u2019s small Government of Qinghai Province and Beijing Normal University , No. 38, Wusi West Road, Chengxi District, Xining, 810008, Qinghai ,","place":["China"]},{"name":"The State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining , No. 38 Wusi Street, Qinghai 810008 ,","place":["China"]}]},{"given":"He","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Communication University of Shanxi , No. 125, Wenhua Street, Yuci District, Jinzhong, 030619, Shanxi ,","place":["China"]}]}],"member":"286","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"2025122407060973300_ref1","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","article-title":"On the connection assignment problem of diagnosable systems","volume":"EC-16","author":"Preparata","year":"1967","journal-title":"IEEE Trans Electron Comput"},{"key":"2025122407060973300_ref2","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1109\/12.177309","article-title":"On self-diagnosable multiprocessor systems: diagnosis by the comparison approach","volume":"41","author":"Sengupta","year":"1992","journal-title":"IEEE Trans Comput"},{"key":"2025122407060973300_ref3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2014.02.024","article-title":"The diagnosability of triangle-free graphs","volume":"530","author":"Lin","year":"2014","journal-title":"Theor Comput Sci"},{"key":"2025122407060973300_ref4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1093\/comjnl\/bxx057","article-title":"Diagnosability evaluation of the data center network DCell","volume":"61","author":"Li","year":"2018","journal-title":"Comput J"},{"key":"2025122407060973300_ref5","doi-asserted-by":"publisher","first-page":"7584","DOI":"10.1007\/s11227-022-04949-8","article-title":"Diagnosability for a family of matching composition networks","volume":"79","author":"Chen","year":"2023","journal-title":"J Supercomput"},{"key":"2025122407060973300_ref6","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.3390\/math11122615","article-title":"The diagnosability of the generalized Cartesian product of networks","volume":"11","author":"Chen","year":"2023","journal-title":"Mathematics"},{"key":"2025122407060973300_ref7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.dam.2024.07.030","article-title":"The diagnosability of interconnection networks","volume":"357","author":"Wang","year":"2024","journal-title":"Discrete Appl Math"},{"key":"2025122407060973300_ref8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TC.2005.19","article-title":"Conditional diagnosability measures for large multiprocessor systems","volume":"54","author":"Lai","year":"2005","journal-title":"IEEE Trans Comput"},{"key":"2025122407060973300_ref9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1109\/TDSC.2016.2562620","article-title":"Conditional diagnosability of $\\left (n,k\\right )$-star graphs under the $PMC$ model","volume":"15","author":"Chang","year":"2018","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2025122407060973300_ref10","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1142\/S0129054112500256","article-title":"Conditional fault diagnosability of dualcube","volume":"23","author":"Zhou","year":"2012","journal-title":"Int J Found Comput Sci"},{"key":"2025122407060973300_ref11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11227-007-0167-8","article-title":"On conditional diagnosability and reliability of the BC networks","volume":"45","author":"Zhu","year":"2008","journal-title":"J Supercomput"},{"key":"2025122407060973300_ref12","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1090\/S0002-9947-1984-0743738-4","article-title":"Minimal cyclic-4-connected graphs","volume":"284","author":"Robertson.","year":"1984","journal-title":"Trans Am Math Soc"},{"key":"2025122407060973300_ref13","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1142\/S1793830911001322","article-title":"Cyclic connectivity of star graph","volume":"3","author":"Liu","year":"2011","journal-title":"Discrete Math Algorithm Appl"},{"key":"2025122407060973300_ref14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1080\/17445760.2019.1659259","article-title":"Cyclic vertex connectivity of Cartesian product graphs","volume":"35","author":"Qin","year":"2019","journal-title":"Int J Parallel Emergent Distrib Syst"},{"key":"2025122407060973300_ref15","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s00373-012-1172-0","article-title":"Cyclic vertex connectivity of Cayley graphs generated by transposition trees","volume":"29","author":"Cheng","year":"2013","journal-title":"Graphs Comb"},{"key":"2025122407060973300_ref16","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1007\/s10878-018-0332-4","article-title":"A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k","volume":"37","author":"Liang","year":"2019","journal-title":"J Comb Optim"},{"key":"2025122407060973300_ref17","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s10878-019-00400-6","article-title":"A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs","volume":"38","author":"Liang","year":"2019","journal-title":"J Comb Optim"},{"key":"2025122407060973300_ref18","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1093\/comjnl\/bxad012","article-title":"The cyclic diagnosability of hypercubes under the $PMC$ model and the $M{M}^{\\ast }$ model","volume":"67","author":"Zhang","year":"2024","journal-title":"Comput J"},{"key":"2025122407060973300_ref19","doi-asserted-by":"crossref","first-page":"114816","DOI":"10.1016\/j.tcs.2024.114816","article-title":"The cyclic diagnosability of balanced hypercubes under the $PMC$ and $M{M}^{\\ast }$ model","volume":"1018","author":"Han","year":"2024","journal-title":"Theor Comput Sci"},{"key":"2025122407060973300_ref20","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TR.2023.3301542","article-title":"Characterization of cyclic diagnosability of regular diagnosable networks","volume":"73","author":"Zhang","year":"2024","journal-title":"IEEE Trans Rel"},{"key":"2025122407060973300_ref21","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TC.1984.1676472","article-title":"An $O(n2.5)$ fault identification algorithm for diagnosable systems","volume":"C-33","author":"Dahbura","year":"1984","journal-title":"IEEE Trans Comput"},{"key":"2025122407060973300_ref22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/net.3230230414","article-title":"A new class of interconnection networks based on alternating group","volume":"23","author":"Jwo","year":"1993","journal-title":"Networks"},{"key":"2025122407060973300_ref23","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1016\/j.ipl.2010.08.010","article-title":"A kind of conditional fault tolerance of alternating group graph networks","volume":"110","author":"Zhang","year":"2010","journal-title":"Inf Process Lett"},{"key":"2025122407060973300_ref24","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1109\/TC.2012.15","article-title":"Conditional diagnosability of alternating group graphs","volume":"62","author":"Hao","year":"2013","journal-title":"IEEE Trans Comput"},{"key":"2025122407060973300_ref25","doi-asserted-by":"publisher","first-page":"2352","DOI":"10.1109\/TPDS.2014.2347961","article-title":"The extra connectivity and conditional diagnosability of alternating group networks","volume":"26","author":"Lin","year":"2015","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2025122407060973300_ref26","doi-asserted-by":"crossref","first-page":"2350007","DOI":"10.1142\/S012962642350007X","article-title":"The non-inclusive diagnosability of alternating group graphs","volume":"33","author":"Zhuo","year":"2023","journal-title":"Parallel Process Lett"},{"key":"2025122407060973300_ref27","doi-asserted-by":"publisher","first-page":"17299","DOI":"10.1109\/ACCESS.2019.2896101","article-title":"Minimum neighborhood of alternating group graphs","volume":"7","author":"Huang","year":"2019","journal-title":"IEEE Access"},{"key":"2025122407060973300_ref28","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1002\/net.20319","article-title":"Linearly many faults in 2-tree-generated networks","volume":"55","author":"Cheng","year":"2010","journal-title":"Networks"},{"key":"2025122407060973300_ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"2025122407060973300_ref30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2019.05.034","article-title":"Extra diagnosability and good-neighbor diagnosability of $n$-dimensional alternating group graph $A{G}\\_n$ under the $PMC$ model","volume":"795","author":"Huang","year":"2019","journal-title":"Theor Comput Sci"},{"key":"2025122407060973300_ref31","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/TR.2020.3021233","article-title":"A complete fault tolerant method for extra fault diagnosability of alternating group graphs","volume":"70","author":"Lin","year":"2021","journal-title":"IEEE Trans Rel"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/12\/1938\/63924971\/bxaf085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/12\/1938\/63924971\/bxaf085.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:06:13Z","timestamp":1766577973000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/12\/1938\/8221471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":31,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,8,3]]},"published-print":{"date-parts":[[2025,12,24]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf085","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2025,12]]},"published":{"date-parts":[[2025,8,3]]}}}