Line digraph iterations and diameter vulnerability

Feng Cao; Ding Zhu Du; Shitou Han; Dongsoo Kim; Ting Yu

doi:10.11650/twjm/1500407128

Line digraph iterations and diameter vulnerability

Feng Cao^*
, Ding Zhu Du
, Shitou Han
, Dongsoo Kim
, Ting Yu

^*Corresponding author for this work

University of Minnesota Twin Cities

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

2 Citations (Scopus)

Abstract

Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general theorem on diameter vulnerability based on the line digraph iteration which improves and generalizes several existing results in the literature.

Original language	English
Pages (from-to)	281-290
Number of pages	10
Journal	Taiwanese Journal of Mathematics
Volume	3
Issue number	3
DOIs	https://doi.org/10.11650/twjm/1500407128
Publication status	Published - Sept 1999
Externally published	Yes

Keywords

Diameter vulnerability
Interconnection network
Line digraph iteration

Access to Document

10.11650/twjm/1500407128

Cite this

@article{e550b87bb06a4b07a8bb4638f9e6c3e6,

title = "Line digraph iterations and diameter vulnerability",

abstract = "Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general theorem on diameter vulnerability based on the line digraph iteration which improves and generalizes several existing results in the literature.",

keywords = "Diameter vulnerability, Interconnection network, Line digraph iteration",

author = "Feng Cao and Du, \{Ding Zhu\} and Shitou Han and Dongsoo Kim and Ting Yu",

year = "1999",

month = sep,

doi = "10.11650/twjm/1500407128",

language = "English",

volume = "3",

pages = "281--290",

journal = "Taiwanese Journal of Mathematics",

issn = "1027-5487",

publisher = "Mathematical Society of the Rep. of China",

number = "3",

}

TY - JOUR

T1 - Line digraph iterations and diameter vulnerability

AU - Cao, Feng

AU - Du, Ding Zhu

AU - Han, Shitou

AU - Kim, Dongsoo

AU - Yu, Ting

PY - 1999/9

Y1 - 1999/9

N2 - Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general theorem on diameter vulnerability based on the line digraph iteration which improves and generalizes several existing results in the literature.

AB - Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general theorem on diameter vulnerability based on the line digraph iteration which improves and generalizes several existing results in the literature.

KW - Diameter vulnerability

KW - Interconnection network

KW - Line digraph iteration

UR - https://www.scopus.com/pages/publications/0038138988

U2 - 10.11650/twjm/1500407128

DO - 10.11650/twjm/1500407128

M3 - Article

AN - SCOPUS:0038138988

SN - 1027-5487

VL - 3

SP - 281

EP - 290

JO - Taiwanese Journal of Mathematics

JF - Taiwanese Journal of Mathematics

IS - 3

ER -

Line digraph iterations and diameter vulnerability

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this