Abstract
The fault tolerability of the network is usually measured by the classical or generalized connectivity of the graph. For any subset with , a tree T is called an S-tree if . Furthermore, any two S-tree and are internally disjoint if and . We denote by the maximum number of pairwise internally disjoint S-trees in G. For an integer , the generalized k-connectivity of a graph G is defined as and . In this paper, we establish the generalized 4-connectivity of the Cayley graph generated by complete graphs.
Disclosure statement
No potential conflict of interest was reported by the author(s).