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

DOI10.1016/0166-218X(93)E0165-UzbMATH Open0829.05032OpenAlexW2051750559MaRDI QIDQ1891920FDOQ1891920

Authors: 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

Recommendations

• Diameter-vulnerability of large bipartite digraphs
• scientific article; zbMATH DE number 4108811
• Dense bipartite digraphs
• A line digraph of a complete bipartite digraph
• Asymptotically optimal \((\Delta, D', s)\)-digraphs

zbMATH Keywords

distancediameterdigraphinterconnection networksupper bounddisjoint pathsline digraphout-degreebipartite digraphMenger-type condition

Mathematics Subject Classification ID

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

Cites Work

• Line Digraph Iterations and the (d, k) Digraph Problem
• Dense bipartite digraphs
• Title not available (Why is that?)
• On the linegraph of a directed-graph
• Large fault-tolerant interconnection networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
• Title not available (Why is that?)
• Large \((d,D, D',s)\)-bipartite digraphs

Cited In (8)

• Title not available (Why is that?)
• Large vertex symmetric digraphs
• Large \((d,D, D',s)\)-bipartite digraphs
• A line digraph of a complete bipartite digraph
• Diameter-vulnerability of large bipartite digraphs
• On large bipartite graphs of diameter 3
• On large \((\Delta , D, D, 1)\)-graphs
• On Moore bipartite digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891920)