Connectivity of large bipartite digraphs and graphs

DOI10.1016/S0012-365X(97)00313-0MaRDI QIDQ1377820zbMATH OpenOpenAlexFDO

Authors 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

diameterconnectivityorderdegreeedge-connectivitybipartite digraph

Mathematics Subject Classification ID

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

Recommendations

• Bipartite graphs and digraphs with maximum connectivity
• On the distance connectivity of graphs and digraphs
• Superconnectivity of bipartite digraphs and graphs

Cites work

• scientific article; zbMATH DE number 4208109 (Why is no real title available?)
• scientific article; zbMATH DE number 4162905 (Why is no real title available?)
• scientific article; zbMATH DE number 4162914 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 597594 (Why is no real title available?)
• scientific article; zbMATH DE number 3281509 (Why is no real title available?)
• Connectivity of Regular Directed Graphs with Small Diameters
• Dense bipartite digraphs
• Large fault-tolerant interconnection networks
• Line Digraph Iterations and the (d, k) Digraph Problem
• Maximally connected digraphs
• On the distance connectivity of graphs and digraphs
• On the linegraph of a directed-graph
• Sufficient conditions for maximally connected dense graphs
• The connectivity of large digraphs and graphs

Cited in

(10)

• Biconnectivity approximations and graph carvings
• scientific article; zbMATH DE number 4162905 (Why is no real title available?)
• On local connectivity of graphs
• Linear connectivity forces large complete bipartite minors
• scientific article; zbMATH DE number 927075 (Why is no real title available?)
• Superconnectivity of bipartite digraphs and graphs
• Lower bounds on the vertex-connectivity of digraphs and graphs
• scientific article; zbMATH DE number 1390507 (Why is no real title available?)
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• The connectivity of large digraphs and graphs

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

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