The generalized 4-connectivity of hypercubes
2017; Elsevier BV; Volume: 220; Linguagem: Inglês
10.1016/j.dam.2016.12.003
ISSN1872-6771
Autores Tópico(s)Software-Defined Networks and 5G
ResumoThe 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 Q n is ( n − 1 ) , that is, for any four vertices in Q n , there exist ( n − 1 ) internally disjoint trees connecting them in Q n .
Referência(s)