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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 190514708
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Cyclic connectivity and cyclic diagnosability of alternating group graphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Tian%2C+Ting%22">Tian, Ting</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Zhang%2C+Shumin%22">Zhang, Shumin</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Li%2C+He%22">Li, He</searchLink><relatesTo>3</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer+Journal%22">Computer Journal</searchLink>. Dec2025, Vol. 68 Issue 12, p1938-1948. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Multiprocessors%22">Multiprocessors</searchLink><br /><searchLink fieldCode="DE" term="%22Fault+tolerance+%28Engineering%29%22">Fault tolerance (Engineering)</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Multistage+interconnection+networks%22">Multistage interconnection networks</searchLink><br /><searchLink fieldCode="DE" term="%22Reliability+in+engineering%22">Reliability in engineering</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=190514708
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/comjnl/bxaf085
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 1938
    Subjects:
      – SubjectFull: Multiprocessors
        Type: general
      – SubjectFull: Fault tolerance (Engineering)
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Multistage interconnection networks
        Type: general
      – SubjectFull: Reliability in engineering
        Type: general
    Titles:
      – TitleFull: Cyclic connectivity and cyclic diagnosability of alternating group graphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Tian, Ting
      – PersonEntity:
          Name:
            NameFull: Zhang, Shumin
      – PersonEntity:
          Name:
            NameFull: Li, He
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 00104620
          Numbering:
            – Type: volume
              Value: 68
            – Type: issue
              Value: 12
          Titles:
            – TitleFull: Computer Journal
              Type: main
ResultId 1