{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:36:54Z","timestamp":1762299414691,"version":"3.37.3"},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T00:00:00Z","timestamp":1596585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702100","U1905211","61771140","61773415"],"award-info":[{"award-number":["61702100","U1905211","61771140","61773415"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010261","name":"Fok Ying Tung Education Foundation","doi-asserted-by":"publisher","award":["171061"],"award-info":[{"award-number":["171061"]}],"id":[{"id":"10.13039\/501100010261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008462","name":"Fujian University of Technology","doi-asserted-by":"publisher","award":["GY-Z17008","GY-Z18145"],"award-info":[{"award-number":["GY-Z17008","GY-Z18145"]}],"id":[{"id":"10.13039\/501100008462","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,3,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>As the size of a multiprocessor system grows, the probability that faults occur in this system increases. One measure of the reliability of a multiprocessor system is the probability that a fault-free subsystem of a certain size still exists with the presence of individual faults. In this paper, we use the probabilistic fault model to establish the subgraph reliability for $AG_n$, the $n$-dimensional alternating group graph. More precisely, we first analyze the probability $R_n^{n-1}(p)$ that at least one subgraph with dimension $n-1$ is fault-free in $AG_n$, when given a uniform probability of a single vertex being fault-free. Since subgraphs of $AG_n$ intersect in rather complicated manners, we resort to the principle of inclusion\u2013exclusion by considering intersections of up to five subgraphs and obtain an upper bound of the probability. Then we consider the probabilistic fault model when the probability of a single vertex being fault-free is nonuniform, and we show that the upper bound under these two models is very close to the lower bound obtained in a previous result, and it is better than the upper bound deduced from that of the arrangement graph, which means that the upper bound we obtained is very tight.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa088","type":"journal-article","created":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T11:21:26Z","timestamp":1593256886000},"page":"589-605","source":"Crossref","is-referenced-by-count":2,"title":["Subgraph Reliability of Alternating Group Graph With Uniform and Nonuniform Vertex Fault-Free Probabilities"],"prefix":"10.1093","volume":"65","author":[{"given":"Yanze","family":"Huang","sequence":"first","affiliation":[{"name":"College of Mathematics and Informatics, Key Laboratory of Network Security and Cryptology, Center for Applied Mathematics of Fujian Province, Fujian Normal University, Fuzhou, Fujian, 350117, P.R. China"},{"name":"School of Mathematics and Physics, Institute of Machine Learning and Intelligent Sciences, Fujian University of Technology, Fuzhou, Fujian, 350118, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Limei","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Mathematics and Informatics, Key Laboratory of Network Security and Cryptology, Center for Applied Mathematics of Fujian Province, Fujian Normal University, Fuzhou, Fujian, 350117, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Xu","sequence":"additional","affiliation":[{"name":"College of Mathematics and Informatics, Key Laboratory of Network Security and Cryptology, Center for Applied Mathematics of Fujian Province, Fujian Normal University, Fuzhou, Fujian, 350117, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2020,8,5]]},"reference":[{"key":"2022031814092632900_ref1","doi-asserted-by":"crossref","first-page":"2337","DOI":"10.1016\/j.ins.2007.11.015","article-title":"Substar reliability analysis in star networks","volume":"178","author":"Wu","year":"2008","journal-title":"Inf. Sci."},{"key":"2022031814092632900_ref2","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1109\/71.139205","article-title":"A unified task-based dependability model for hypercube computers","volume":"3","author":"Das","year":"1992","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2022031814092632900_ref3","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/71.273045","article-title":"Improved lower bounds on the reliability of hypercube architectures","volume":"5","author":"Soh","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2022031814092632900_ref4","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1109\/12.392856","article-title":"A combinatorial analysis of subcube reliability in hypercube","volume":"44","author":"Chang","year":"1995","journal-title":"IEEE Trans. Comput."},{"key":"2022031814092632900_ref5","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/24.974129","article-title":"Framework for modeling software reliability, using various testing-efforts and fault-detection rates","volume":"50","author":"Kuo","year":"2001","journal-title":"IEEE Trans. Rel."},{"key":"2022031814092632900_ref6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1142\/S0219265905001290","article-title":"Hypercube network fault tolerance: a probabilistic approach","volume":"6","author":"Chen","year":"2005","journal-title":"J. Interconn. Netw."},{"key":"2022031814092632900_ref7","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1016\/j.ins.2006.11.003","article-title":"On reliability of the folded hypercubes","volume":"177","author":"Zhu","year":"2007","journal-title":"Inf. Sci."},{"key":"2022031814092632900_ref8","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.jpdc.2006.09.002","article-title":"Probabilistic analysis on mesh network fault tolerance","volume":"67","author":"Chen","year":"2007","journal-title":"J. Parallel Distrib. Comput."},{"key":"2022031814092632900_ref9","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.ipl.2011.12.013","article-title":"Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability","volume":"112","author":"Wang","year":"2012","journal-title":"Inf. Process. Lett."},{"key":"2022031814092632900_ref10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.jpdc.2011.11.006","article-title":"Upper bounds on the connection probability for 2-$\\mathrm{D}$ meshes and tori","volume":"72","author":"Liang","year":"2012","journal-title":"J. Parallel Distrib. Comput."},{"key":"2022031814092632900_ref11","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TR.2015.2413372","article-title":"The reliability of subgraphs in the arrangement graph","volume":"64","author":"Lin","year":"2015","journal-title":"IEEE Trans. Rel."},{"key":"2022031814092632900_ref12","doi-asserted-by":"crossref","first-page":"1700","DOI":"10.1109\/TR.2016.2570544","article-title":"The reliability analysis based on subsystems of $(\\mathrm{n},\\mathrm{k})$-star graph","volume":"65","author":"Li","year":"2016","journal-title":"IEEE Trans. Rel."},{"key":"2022031814092632900_ref13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ins.2017.06.012","article-title":"Combinatorial analysis of the subsystem reliability of the split-star network","volume":"415-416","author":"Kung","year":"2017","journal-title":"Inf. Sci."},{"key":"2022031814092632900_ref14","first-page":"760","article-title":"Fault-tolerant cycle-embedding in alternating group graphs","volume":"197","author":"Chang","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"2022031814092632900_ref15","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.ins.2008.10.030","article-title":"Embedding hamiltonian cycles in alternating group graphs under conditional fault model","volume":"179","author":"Tsai","year":"2009","journal-title":"Inf. Sci."},{"key":"2022031814092632900_ref16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TC.2004.1255789","article-title":"Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs","volume":"53","author":"Hsu","year":"2004","journal-title":"IEEE Trans. Comput."},{"key":"2022031814092632900_ref17","first-page":"6785","article-title":"Fault tolerance of vertex pancyclicity in alternating group graphs","volume":"217","author":"Szepietowski","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"2022031814092632900_ref18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.tcs.2018.03.010","article-title":"On the reliability of alternating group graph-based networks","volume":"728","author":"Huang","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"2022031814092632900_ref19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3387-7","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"Xu","year":"2001"},{"key":"2022031814092632900_ref20","doi-asserted-by":"crossref","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":"Netw."},{"key":"2022031814092632900_ref21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-0685-4","volume-title":"Reliability Evaluation of Engineering Systems: Concepts and Techniques","author":"Billinton","year":"1992"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/3\/589\/42896832\/bxaa088.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/3\/589\/42896832\/bxaa088.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T14:10:51Z","timestamp":1647612651000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/65\/3\/589\/5879957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,5]]},"references-count":21,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,8,5]]},"published-print":{"date-parts":[[2022,3,14]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa088","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2022,3]]},"published":{"date-parts":[[2020,8,5]]}}}