Connectivity of large bipartite digraphs and graphs
This paper studies the relation between the connectivity \(\kappa\) (edge-connectivity \(\lambda\)) and some other parameters of a bipartite graph or digraph \(G\). Namely, the order \(n\), minimum degree \(\delta\), maximum degree \(\Delta\), diameter \(D\), and a parameter \(\ell\) introduced by \textit{J. Fàbrega} and \textit{M. A. Fiol}, in [J. Graph Theory 13, 657-668 (1989; Zbl 0688.05029)] related to the number of short paths that exist between every pair of vertices. A main result reads: If \(G\) is a bipartite digraph with \(n>(\delta -1)(\Delta +\Delta^2+\cdots+\Delta^\ell +\Delta +\Delta^2+\cdots+\Delta^{D-\ell -1})+2\), then \(\kappa=\delta\). Similar results are proved for \(\lambda\) and also for the undirected case.
- Connectivity of Regular Directed Graphs with Small Diameters
- Dense bipartite digraphs
- 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?)
- 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
- Linear connectivity forces large complete bipartite minors
- Superconnectivity of bipartite digraphs and graphs
- Bipartite graphs and digraphs with maximum connectivity
- On local connectivity of graphs
- scientific article; zbMATH DE number 4162905 (Why is no real title available?)
- Biconnectivity approximations and graph carvings
- The connectivity of large digraphs and graphs
- scientific article; zbMATH DE number 927075 (Why is no real title available?)
- scientific article; zbMATH DE number 1390507 (Why is no real title available?)
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Lower bounds on the vertex-connectivity of 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)
