Premium
Maximal vertex‐connectivity of $\overrightarrow{S_{n,k}}$
Author(s) -
Cheng Eddie,
Lindsey William A.,
Steffy Daniel E.
Publication year - 2005
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20084
Subject(s) - star (game theory) , vertex (graph theory) , combinatorics , generalization , class (philosophy) , mathematics , graph , computer science , discrete mathematics , artificial intelligence , mathematical analysis
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, $\overrightarrow{S_{n,k}}$ , given by Cheng and Lipman, 8, and show that it is maximally connected. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(3), 154–162 2005