Super link-connectivity of iterated line digraphs

被引：4

作者：

Cheng, XY

Du, XF

Min, MK

Ngo, HQ

Ruan, L ^{[1
]}

Sun, JH

Wu, WL

机构：

[1] Iowa State Univ, Dept Comp Sci, Ames, IA 50011 USA

[2] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA

[3] Qiqihar Univ, Dept Math, Qiqihar, Peoples R China

[4] Univ Minnesota, Dept Comp Sci, Minneapolis, MN 55455 USA

[5] SUNY Buffalo, Dept Comp Sci & Engn, Buffalo, NY 14260 USA

[6] Univ Texas, Dept Comp Sci, Richardson, TX 75083 USA

来源：

THEORETICAL COMPUTER SCIENCE | 2003年 / 304卷 / 1-3期

关键词：

line digraph iterations; super link-connectivity; interconnection networks;

D O I：

10.1016/S0304-3975(03)00282-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this paper, we show that the link-digraph iteration preserves super link-connectivity. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：461 / 469

页数：9

共 23 条

[1] LARGE FAULT-TOLERANT INTERCONNECTION NETWORKS [J].

BERMOND, JC ;

HOMOBONO, N ;

PEYRAT, C .

GRAPHS AND COMBINATORICS, 1989, 5 (02) :107-123

[2] SUPER LINE-CONNECTIVITY PROPERTIES OF CIRCULANT GRAPHS [J].

BOESCH, FT ;

WANG, JF .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (01) :89-98

[3] Cayley digraphs from complete generalized cycles [J].

Brunat, JM ;

Espona, M ;

Fiol, MA ;

Serra, O .

EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (05) :337-349

[4]

Brunat JM, 1999, DISCRETE MATH, V197, P157

[5] Line digraph iterations and diameter vulnerability [J].

Cao, F ;

Du, DZ ;

Han, S ;

Kim, D ;

Yu, T .

TAIWANESE JOURNAL OF MATHEMATICS, 1999, 3 (03) :281-290

[6] Super line-connectivity of consecutive-d digraphs [J].

Cao, F ;

Du, DZ ;

Hsu, DF ;

Hwang, LH ;

Wu, WL .

DISCRETE MATHEMATICS, 1998, 183 (1-3) :27-38

[7]

de Bruijn NG, 1946, KONINKLIJKE NEDERLAN, V49, P758

[8] GENERALIZED DE BRUIJN DIGRAPHS [J].

DU, DZ ;

HWANG, FK .

NETWORKS, 1988, 18 (01) :27-38

[9] LINE DIGRAPH ITERATIONS AND CONNECTIVITY ANALYSIS OF DEBRUIJN AND KAUTZ GRAPHS [J].

DU, DZ ;

LYUU, YD ;

HSU, DF .

IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (05) :612-616

[10]

Ferrero D, 1999, DISCRETE MATH, V197, P285

← 1 2 3 →