Large \((d,D, D',s)\)-bipartite digraphs
From MaRDI portal
Publication:1891920
DOI10.1016/0166-218X(93)E0165-UzbMath0829.05032MaRDI QIDQ1891920
Publication date: 10 January 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0165-u
upper bound; digraph; distance; diameter; interconnection networks; line digraph; bipartite digraph; disjoint paths; out-degree; Menger-type condition
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C20: Directed graphs (digraphs), tournaments
Related Items
Large \((d,D, D',s)\)-bipartite digraphs, Diameter-vulnerability of large bipartite digraphs, On large (Δ, D, D, 1)-graphs
Cites Work
- Large fault-tolerant interconnection networks
- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
- Large \((d,D, D',s)\)-bipartite digraphs
- On the linegraph of a directed-graph
- Line Digraph Iterations and the (d, k) Digraph Problem
- Dense bipartite digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item