| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949709 | Discrete Applied Mathematics | 2017 | 8 Pages |
Abstract
The connectivity and the spanning tree packing number of a graph are two important measurements for the fault-tolerance of a network. The generalized connectivity is a common generalization of the classical connectivity and spanning tree packing number. In this paper, we show that the generalized 4-connectivity of the n-dimensional hypercube Qn is (nâ1), that is, for any four vertices in Qn, there exist (nâ1) internally disjoint trees connecting them in Qn.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Shangwei Lin, Qianhua Zhang,