Connectivity of large bipartite digraphs and graphs

DOI10.1016/S0012-365X(97)00313-0zbMath0886.05085OpenAlexW1977037817MaRDI QIDQ1377820

J. Ning

Publication date: 8 April 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00313-0

zbMATH Keywords

diameterdegreeorderconnectivityedge-connectivitybipartite digraph

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ On local connectivity of graphs ⋮ Superconnectivity of bipartite digraphs and graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• Large fault-tolerant interconnection networks
• On the distance connectivity of graphs and digraphs
• On the linegraph of a directed-graph
• Connectivity of Regular Directed Graphs with Small Diameters
• Line Digraph Iterations and the (d, k) Digraph Problem
• Maximally connected digraphs
• The connectivity of large digraphs and graphs
• Dense bipartite digraphs

This page was built for publication: Connectivity of large bipartite digraphs and graphs