Taiwanese Journal of Mathematics

LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY

Feng Cao, Ding-Zhu Du, Shitou Han, Dongsoo Kim, and Ting Yu

Full-text: Open access

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.

Article information

Source
Taiwanese J. Math., Volume 3, Number 3 (1999), 281-290.

Dates
First available in Project Euclid: 18 July 2017

Permanent link to this document
https://projecteuclid.org/euclid.twjm/1500407128

Digital Object Identifier
doi:10.11650/twjm/1500407128

Mathematical Reviews number (MathSciNet)
MR1705986

Zentralblatt MATH identifier
0936.05048

Subjects
Primary: 05C20: Directed graphs (digraphs), tournaments

Keywords
line digraph iteration diameter vulnerability interconnection network

Citation

Cao, Feng; Du, Ding-Zhu; Han, Shitou; Kim, Dongsoo; Yu, Ting. LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY. Taiwanese J. Math. 3 (1999), no. 3, 281--290. doi:10.11650/twjm/1500407128. https://projecteuclid.org/euclid.twjm/1500407128


Export citation