Structure connectivity and substructure connectivity of strong exchanged hypercube.

Saved in:
Bibliographic Details
Title: Structure connectivity and substructure connectivity of strong exchanged hypercube.
Authors: Ma, Zheng1 (AUTHOR) mazheng9041@163.com, Ren, Shengzhang1 (AUTHOR) renshengzhang1980@163.com
Source: Theoretical Computer Science. Apr2026, Vol. 1069, pN.PAG-N.PAG. 1p.
Subjects: Hypercube networks (Computer networks), Graph connectivity, Computer network reliability, Fault tolerance (Engineering)
Abstract: As a fundamental variant of hypercube networks, the exchanged hypercube EH (s, t) is among the most prevalent interconnection topologies in modern computing systems. While connectivity is closely related to network reliability and fault tolerance. The exchange hypercube EH (s, t) is a common interconnection topology. To enhance its connectivity, we propose the strong exchange hypercube (SEH (s, t)) by adding a set of specific edges, denoted as E 4. Lin et al. extended the notion of connectivity by introducing two new kinds of connectivity, called structure connectivity κ (G ; H) and substructure connectivity κs (SEH (s, t); H), respectively. In this paper, we characterize the κ (SEH (s, t); H) and κs (SEH (s, t); H) of SEH (s, t) for H ∈ { P k , K 1, r , C 2 m }, where 2 ⩽ k ⩽ 2 s + 1 ⩽ s + t + 1 , 2 ≤ r ≤ s ≤ t , 4 ≤ 2 m ≤ 2 s. [ABSTRACT FROM AUTHOR]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. 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: 192173892
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Structure connectivity and substructure connectivity of strong exchanged hypercube.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Ma%2C+Zheng%22">Ma, Zheng</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> mazheng9041@163.com</i><br /><searchLink fieldCode="AR" term="%22Ren%2C+Shengzhang%22">Ren, Shengzhang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> renshengzhang1980@163.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Apr2026, Vol. 1069, pN.PAG-N.PAG. 1p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Hypercube+networks+%28Computer+networks%29%22">Hypercube networks (Computer networks)</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+connectivity%22">Graph connectivity</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+reliability%22">Computer network reliability</searchLink><br /><searchLink fieldCode="DE" term="%22Fault+tolerance+%28Engineering%29%22">Fault tolerance (Engineering)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: As a fundamental variant of hypercube networks, the exchanged hypercube EH (s, t) is among the most prevalent interconnection topologies in modern computing systems. While connectivity is closely related to network reliability and fault tolerance. The exchange hypercube EH (s, t) is a common interconnection topology. To enhance its connectivity, we propose the strong exchange hypercube (SEH (s, t)) by adding a set of specific edges, denoted as E 4. Lin et al. extended the notion of connectivity by introducing two new kinds of connectivity, called structure connectivity κ (G ; H) and substructure connectivity κs (SEH (s, t); H), respectively. In this paper, we characterize the κ (SEH (s, t); H) and κs (SEH (s, t); H) of SEH (s, t) for H ∈ { P k , K 1, r , C 2 m }, where 2 ⩽ k ⩽ 2 s + 1 ⩽ s + t + 1 , 2 ≤ r ≤ s ≤ t , 4 ≤ 2 m ≤ 2 s. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Theoretical Computer Science is the property of Elsevier B.V. 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=192173892
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.tcs.2026.115801
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 1
        StartPage: N.PAG
    Subjects:
      – SubjectFull: Hypercube networks (Computer networks)
        Type: general
      – SubjectFull: Graph connectivity
        Type: general
      – SubjectFull: Computer network reliability
        Type: general
      – SubjectFull: Fault tolerance (Engineering)
        Type: general
    Titles:
      – TitleFull: Structure connectivity and substructure connectivity of strong exchanged hypercube.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ma, Zheng
      – PersonEntity:
          Name:
            NameFull: Ren, Shengzhang
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 20
              M: 04
              Text: Apr2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 1069
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1