Maximal vertex‐connectivity of $\overrightarrow{S_{n,k}}$
2005; Wiley; Volume: 46; Issue: 3 Linguagem: Inglês
10.1002/net.20084
ISSN1097-0037
AutoresEddie Cheng, William A. Lindsey, Daniel E. Steffy,
Tópico(s)Supercapacitor Materials and Fabrication
ResumoAbstract 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
Referência(s)