Large \((d,D, D',s)\)-bipartite digraphs
type: Item
instance of: scholarly article
title: Large \((d,D, D',s)\)-bipartite digraphs
zbMATH Open document ID: 0829.05032
DOI: 10.1016/0166-218X(93)E0165-U
author: Yanyan Li
published in: Discrete Applied Mathematics
publication date: 1996-01-10T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 761077
zbMATH Keywords: line digraph
zbMATH Keywords: distance
zbMATH Keywords: interconnection networks
zbMATH Keywords: bipartite digraph
zbMATH Keywords: diameter
zbMATH Keywords: out-degree
zbMATH Keywords: digraph
zbMATH Keywords: Menger-type condition
zbMATH Keywords: disjoint paths
zbMATH Keywords: upper bound
MaRDI profile type: Publication
cites work: On the linegraph of a directed-graph
cites work: Large fault-tolerant interconnection networks
cites work: Q3794213
cites work: Q3686639
cites work: Q3818315
cites work: Dense bipartite digraphs
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
cites work: Q4721969
cites work: Q3832603
cites work: The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
full work available at URL: 0166-218x(93)e0165-u
OpenAlex ID: W2051750559
description: scientific article; zbMATH DE number 761077