Edge fault tolerance of super edge connectivity for three families of interconnection networks

详细信息    查看全文

• 作者：Dongye Wang ^{wangdy04@mails.tsinghua.edu.cn} ; Mei Lu ; ^{mlu@math.tsinghua.edu.cn}
• 关键词：Edge fault tolerance of super edge connectivity ; Edge connectivity ; Super-¦Ë ; Interconnection network
• 刊名：Information Sciences
• 出版年：2012
• 出版时间：1 April, 2012
• 年：2012
• 卷：188
• 期：Complete
• 页码：260-268
• 全文大小：425 K

文摘

Let G = (V, E) be a connected graph. G is said to be super edge connected (or super-¦Ë for short) if every minimum edge cut of G isolates one of the vertex of G. A graph G is called m-super-¦Ë if for any edge set S ?#xA0;E(G) with ?em>S?#xA0;?#xA0;m, G ?#xA0;S is still super-¦Ë. The maximum cardinality of m-super-¦Ë is called the edge fault tolerance of super edge connectivity of G. In this paper, we discuss the edge fault tolerance of super edge connectivity of three families of interconnection networks.