Maximal vertex-connectivity of Sn,k

The class of star graphs is a popular topology for interconnection networks. However, it has certain deficiencies. A class of generalization of star graphs called (n, k)-star graphs was introduced by Chiang and Chen to address these issues. In this article we will consider the vertex-connectivity of the directed (n, k)-star graph, Sn,k, given by Cheng and Lipman, and show that it is maximally connected.