View in EDS

Cyclic connectivity and cyclic diagnosability of alternating group graphs.

Saved in:
Bibliographic Details
Title: Cyclic connectivity and cyclic diagnosability of alternating group graphs.
Authors: Tian, Ting1 (AUTHOR), Zhang, Shumin2 (AUTHOR), Li, He3 (AUTHOR)
Source: Computer Journal. Dec2025, Vol. 68 Issue 12, p1938-1948. 11p.
Subjects: Multiprocessors, Fault tolerance (Engineering), Graph theory, Multistage interconnection networks, Reliability in engineering
Abstract: 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>6$| under the |$PMC$| model and |$MM^{*}$| model, respectively. [ABSTRACT FROM AUTHOR]
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract: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>6$| under the |$PMC$| model and |$MM^{*}$| model, respectively. [ABSTRACT FROM AUTHOR]
ISSN:00104620
DOI:10.1093/comjnl/bxaf085