Line digraph iterations and diameter vulnerability
type: Item
instance of: scholarly article
title: Line digraph iterations and diameter vulnerability
zbMATH Open document ID: 0936.05048
author: Feng Cao
author: Du Ding-Zhu
author: Shitou Han
author: Ting Yu
author: Dong-Soo Kim
published in: Taiwanese Journal of Mathematics
publication date: 2000-02-15T00:00:00Z
review text: The authors have introduced an \((l_1,\dots ,l_c)-\)seed as a digraph satisfying two relatively simple conditions concerning existence of paths. Examples of seeds known as Kautz digraphs, de Bruijn digraphs, some bipartite digraphs and others are presented. The main theorem is based on the line digraph iteration and it has a lot of corollaries which improve already published or unpublished results (e.g., in \textit{D. Z. Du, D. F. Hsu}, and \textit{Y. D. Lyuu} [Discrete Math. 151, No. 1-3, 81-85 (1996; Zbl 0853.05043)]).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 1370634
zbMATH Keywords: line digraph iteration
zbMATH Keywords: diameter vulnerability
zbMATH Keywords: interconnection network
reviewed by: Matúš Harminc
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.11650/twjm/1500407128
OpenAlex ID: W4250008347
DOI: 10.11650/TWJM/1500407128
description: scientific article; zbMATH DE number 1370634