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 journalArticlepeer-review

4 Scopus citations


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 languageEnglish (US)
Pages (from-to)461-469
Number of pages9
JournalTheoretical Computer Science
Issue number1-3
StatePublished - Jul 28 2003
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


  • Interconnection networks
  • Line digraph iterations
  • Super link-connectivity


Dive into the research topics of 'Super link-connectivity of iterated line digraphs'. Together they form a unique fingerprint.

Cite this