Super link-connectivity of iterated line digraphs

Xiaoyan Cheng; Xiufeng Du; Manki Min; Hung Q. Ngo; Lu Ruan; Jianhua Sun; Weili Wu

doi:10.1016/S0304-3975(03)00282-2

Super link-connectivity of iterated line digraphs

Xiaoyan Cheng
, Xiufeng Du
, Manki Min
, Hung Q. Ngo
, Lu Ruan
, Jianhua Sun
, Weili Wu

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	461-469
Number of pages	9
Journal	Theoretical Computer Science
Volume	304
Issue number	1-3
DOIs	https://doi.org/10.1016/S0304-3975(03)00282-2
State	Published - Jul 28 2003
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Keywords

Interconnection networks
Line digraph iterations
Super link-connectivity

Access to Document

10.1016/S0304-3975(03)00282-2

Cite this

@article{76462dac888e48da907ed1b5c5309556,

title = "Super link-connectivity of iterated line digraphs",

abstract = "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.",

keywords = "Interconnection networks, Line digraph iterations, Super link-connectivity",

author = "Xiaoyan Cheng and Xiufeng Du and Manki Min and Ngo, \{Hung Q.\} and Lu Ruan and Jianhua Sun and Weili Wu",

year = "2003",

month = jul,

day = "28",

doi = "10.1016/S0304-3975(03)00282-2",

language = "English (US)",

volume = "304",

pages = "461--469",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1-3",

}

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

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 - https://www.scopus.com/pages/publications/0037811043

UR - https://www.scopus.com/pages/publications/0037811043#tab=citedBy

U2 - 10.1016/S0304-3975(03)00282-2

DO - 10.1016/S0304-3975(03)00282-2

M3 - Article

AN - SCOPUS:0037811043

SN - 0304-3975

VL - 304

SP - 461

EP - 469

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-3

ER -

Super link-connectivity of iterated line digraphs

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this