Name
Title | ||
|---|---|---|
Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes |
Abstract | ||
|---|---|---|
•The generalized k-connectivity κk(G) is the maximum number of internally disjoint trees connecting any k vertices of G.•The substructure properties of the n-dimensional augmented cube AQn are given.•The results of κ3(AQn)=2n−2 for n=3 or n≥5 are derived.•κ3(AQ4)=5 is derived. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jpdc.2021.04.004 | Journal of Parallel and Distributed Computing |
Keywords | DocType | Volume |
Augmented cubes,Connectivity,Interconnection networks,Internally disjoint Steiner trees,Generalized connectivity | Journal | 154 |
ISSN | Citations | PageRank |
0743-7315 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Wei | 1 | 0 | 1.69 |
| Rongxia Hao | 2 | 165 | 26.11 |
| Jou-Ming Chang | 3 | 546 | 50.92 |