Conditional connectivity of star graph networks under embedding restriction

详细信息    查看全文

• 作者：Yuxing Yang^a ; ^c ; ^{yxyangcn@163.com} ; Shiying Wang^b ; ^{shiying@sxu.edu.cn}
• 关键词：Distributed systems ; Interconnection networks ; Connectivity ; Star graphs
• 刊名：Information Sciences
• 出版年：2012
• 出版时间：15 September, 2012
• 年：2012
• 卷：199
• 期：Complete
• 页码：187-192
• 全文大小：238 K

文摘

The n-dimensional star graph S_n is one of the most attractive interconnection networks of large scale multiprocessor systems. The k-embedding-restricted (edge) connectivity (¦Ç_k(S_n)) ¦Æ_k(S_n) of S_n is defined to be the cardinality of a minimum subset of (edges) nodes, if any, whose deletion disconnects S_n and each node of the remaining components lies in an undamaged k-dimensional substar S_k. In this paper, we investigate the k-embedding-restricted (edge) connectivity of S_n and determine the values of ¦Ç_k(S_n) and ¦Æ_k(S_n) for some k¡¯s.