Large \((d,D, D',s)\)-bipartite digraphs

DOI10.1016/0166-218X(93)E0165-UzbMath0829.05032OpenAlexW2051750559MaRDI QIDQ1891920

Yanyan Li

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

zbMATH Keywords

upper bounddigraphdistancediameterinterconnection networksline digraphbipartite digraphdisjoint pathsout-degreeMenger-type condition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

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

This page was built for publication: Large \((d,D, D',s)\)-bipartite digraphs