Bibliographic Details
| 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 |
