Superconnectivity of bipartite digraphs and graphs
From MaRDI portal
Publication:1292813
DOI10.1016/S0012-365X(99)90041-9zbMATH Open0933.05089OpenAlexW4213246652MaRDI QIDQ1292813FDOQ1292813
Recommendations
Cites work
- 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 3281509 (Why is no real title available?)
- Bipartite graphs and digraphs with maximum connectivity
- Connectivity of Regular Directed Graphs with Small Diameters
- Connectivity of large bipartite digraphs and graphs
- Dense bipartite digraphs
- Large fault-tolerant interconnection networks
- Line Digraph Iterations and the (d, k) Digraph Problem
- Lower-bounds on the connectivities of a graph
- Maximally connected digraphs
- On super-edge-connected digraphs and bipartite digraphs
- On the distance connectivity of graphs and digraphs
- On the linegraph of a directed-graph
- Sufficient conditions for maximally connected dense graphs
- Super edge-connectivity of dense digraphs and graphs
- Synthesis of reliable networks - a survey
- The connectivity of large digraphs and graphs
- The superconnectivity of large digraphs and graphs
Cited in
(26)- Super-pancyclic hypergraphs and bipartite graphs
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- Neighborhood conditions for graphs to be super restricted edge connected
- scientific article; zbMATH DE number 2188350 (Why is no real title available?)
- Super-arc-connectivity properties of strongly connected digraphs
- Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
- A characterization of graphs by codes from their incidence matrices
- Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
- Restricted arc-connectivity of generalized \(p\)-cycles
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- On the superconnectivity and the conditional diameter of graphs and digraphs
- Inverse degree and super edge-connectivity
- Sufficient conditions for a graph to be super restricted edge-connected
- scientific article; zbMATH DE number 5671145 (Why is no real title available?)
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Diameter, short paths and superconnectivity in digraphs
- All (k;g)‐cages are edge‐superconnected
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- scientific article; zbMATH DE number 1810255 (Why is no real title available?)
- Maximally and super connected multisplit graphs and digraphs
- Sufficient conditions for super-arc-strongly connected oriented graphs
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Sufficient conditions for \(k\)-restricted edge connected graphs
- Sufficient conditions for digraphs to be maximally connected and super-connected
- Super-connected and hyper-connected jump graphs
- The superconnectivity of large digraphs and graphs
This page was built for publication: Superconnectivity of bipartite digraphs and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292813)
