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

被引：20

作者：

Wang, Dongye ^{[1
]}

Lu, Mei ^{[1
]}

机构：

[1] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China

来源：

INFORMATION SCIENCES | 2012年 / 188卷

基金：

中国国家自然科学基金;

关键词：

Edge fault tolerance of super edge connectivity; Edge connectivity; Super-lambda; Interconnection network; SUFFICIENT CONDITIONS; GRAPHS; RELIABILITY; DIGRAPHS; PRODUCT;

D O I：

10.1016/j.ins.2011.11.006

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Let G = (V,E) be a connected graph. G is said to be super edge connected (or super-lambda for short) if every minimum edge cut of G isolates one of the vertex of G. A graph G is called m-super-lambda if for any edge set S subset of E(G) with |S| <= m, G - S is still super-lambda. The maximum cardinality of m-super-lambda 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. (C) 2011 Elsevier Inc. All rights reserved.

引用

页码：260 / 268

页数：9

共 26 条

[1] The edge-connectivity and restricted edge-connectivity of a product of graphs [J].

Balbuena, C. ;

Cera, M. ;

Dianez, A. ;

Garcia-Vazquez, P. ;

Marcote, X. .

DISCRETE APPLIED MATHEMATICS, 2007, 155 (18) :2444-2455

[2]

Bauer D., 1981, CONNECTIVITY EXTREMA, P89

[3]

Bondy J. A., 1976, Graduate Texts in Mathematics, V290

[4] Restricted connectivity for three families of interconnection networks [J].

Chen, Y-Chuang ;

Tan, Jimmy J. M. .

APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (02) :1848-1855

[5] Super-connectivity and super-edge-connectivity for some interconnection networks [J].

Chen, YC ;

Tan, JJM ;

Hsu, LH ;

Kao, SS .

APPLIED MATHEMATICS AND COMPUTATION, 2003, 140 (2-3) :245-254

[6] Conditional matching preclusion sets [J].

Cheng, Eddie ;

Lesniak, Linda ;

Lipman, Marc J. ;

Liptak, Laszlo .

INFORMATION SCIENCES, 2009, 179 (08) :1092-1101

[7]

Daily W. J., 1990, IEEE T COMPUT, V39, P775

[8] ON COMPUTING A CONDITIONAL EDGE-CONNECTIVITY OF A GRAPH [J].

ESFAHANIAN, AH ;

HAKIMI, SL .

INFORMATION PROCESSING LETTERS, 1988, 27 (04) :195-199

[9] GENERALIZED MEASURES OF FAULT TOLERANCE WITH APPLICATION TO N-CUBE NETWORKS [J].

ESFAHANIAN, AH .

IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) :1586-1591

[10] EXTRACONNECTIVITY OF GRAPHS WITH LARGE GIRTH [J].

FABREGA, J ;

FIOL, MA .

DISCRETE MATHEMATICS, 1994, 127 (1-3) :163-170

← 1 2 3 →