TY - JOUR
T1 - Super link-connectivity of iterated line digraphs
AU - Cheng, Xiaoyan
AU - Du, Xiufeng
AU - Min, Manki
AU - Ngo, Hung Q.
AU - Ruan, Lu
AU - Sun, Jianhua
AU - Wu, Weili
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2003/7/28
Y1 - 2003/7/28
N2 - 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.
AB - 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.
KW - Interconnection networks
KW - Line digraph iterations
KW - Super link-connectivity
UR - http://www.scopus.com/inward/record.url?scp=0037811043&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037811043&partnerID=8YFLogxK
U2 - 10.1016/S0304-3975(03)00282-2
DO - 10.1016/S0304-3975(03)00282-2
M3 - Article
AN - SCOPUS:0037811043
VL - 304
SP - 461
EP - 469
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - 1-3
ER -