Open Access
1999 LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY
Feng Cao, Ding-Zhu Du, Shitou Han, Dongsoo Kim, Ting Yu
Taiwanese J. Math. 3(3): 281-290 (1999). DOI: 10.11650/twjm/1500407128

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.

Citation

Download Citation

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

Information

Published: 1999
First available in Project Euclid: 18 July 2017

zbMATH: 0936.05048
MathSciNet: MR1705986
Digital Object Identifier: 10.11650/twjm/1500407128

Subjects:
Primary: 05C20‎

Keywords: diameter vulnerability , interconnection network , line digraph iteration

Rights: Copyright © 1999 The Mathematical Society of the Republic of China

Vol.3 • No. 3 • 1999
Back to Top