[formula omitted]-path-connectivity of balanced hypercubes for [formula omitted].
Saved in:
| Title: | [formula omitted]-path-connectivity of balanced hypercubes for [formula omitted]. |
|---|---|
| Authors: | Zhao, Zeng1 (AUTHOR) zhaozeng1125@163.com, Li, Shasha1 (AUTHOR) lishasha@nbu.edu.cn |
| Source: | Discrete Applied Mathematics. Jul2026, Vol. 388, p187-200. 14p. |
| Subjects: | Graph connectivity, Hypercubes, Computer network architectures, Graph theory |
| Abstract: | Let G = (V , E) be a graph, and let S ⊆ V (G) be a set of size at least 2. A path in G is called an S -path if it contains all vertices of S. Denote by π G (S) the maximum number of internally disjoint S -paths in G. The k -path-connectivity π k (G) of G is then defined as the minimum π G (S) , where S ranges over all k -subsets of V (G). The n -dimensional balanced hypercube B H n , introduced by Wu and Huang as a variant of the hypercube, is a widely used network topology. In this paper, we investigate the k -path-connectivity of B H n for k = 3 and 4. We first show that for 3 ⩽ k ⩽ 4 n − 2 n , the k -path-connectivity of B H n is bounded above by n. Moreover, we prove that this upper bound is tight for k = 3 and 4, i.e., π 3 (B H n) = π 4 (B H n) = n. [ABSTRACT FROM AUTHOR] |
| Copyright of Discrete Applied Mathematics 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: 193310436 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: [formula omitted]-path-connectivity of balanced hypercubes for [formula omitted]. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Zhao%2C+Zeng%22">Zhao, Zeng</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> zhaozeng1125@163.com</i><br /><searchLink fieldCode="AR" term="%22Li%2C+Shasha%22">Li, Shasha</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> lishasha@nbu.edu.cn</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Discrete+Applied+Mathematics%22">Discrete Applied Mathematics</searchLink>. Jul2026, Vol. 388, p187-200. 14p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Graph+connectivity%22">Graph connectivity</searchLink><br /><searchLink fieldCode="DE" term="%22Hypercubes%22">Hypercubes</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+architectures%22">Computer network architectures</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Let G = (V , E) be a graph, and let S ⊆ V (G) be a set of size at least 2. A path in G is called an S -path if it contains all vertices of S. Denote by π G (S) the maximum number of internally disjoint S -paths in G. The k -path-connectivity π k (G) of G is then defined as the minimum π G (S) , where S ranges over all k -subsets of V (G). The n -dimensional balanced hypercube B H n , introduced by Wu and Huang as a variant of the hypercube, is a widely used network topology. In this paper, we investigate the k -path-connectivity of B H n for k = 3 and 4. We first show that for 3 ⩽ k ⩽ 4 n − 2 n , the k -path-connectivity of B H n is bounded above by n. Moreover, we prove that this upper bound is tight for k = 3 and 4, i.e., π 3 (B H n) = π 4 (B H n) = n. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Discrete Applied Mathematics 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=193310436 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.dam.2026.03.050 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 14 StartPage: 187 Subjects: – SubjectFull: Graph connectivity Type: general – SubjectFull: Hypercubes Type: general – SubjectFull: Computer network architectures Type: general – SubjectFull: Graph theory Type: general Titles: – TitleFull: [formula omitted]-path-connectivity of balanced hypercubes for [formula omitted]. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Zhao, Zeng – PersonEntity: Name: NameFull: Li, Shasha IsPartOfRelationships: – BibEntity: Dates: – D: 31 M: 07 Text: Jul2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 0166218X Numbering: – Type: volume Value: 388 Titles: – TitleFull: Discrete Applied Mathematics Type: main |
| ResultId | 1 |
