Superconnectivity of bipartite digraphs and graphs
From MaRDI portal
Publication:1292813
DOI10.1016/S0012-365X(99)90041-9zbMATH Open0933.05089OpenAlexW4213246652MaRDI QIDQ1292813FDOQ1292813
Authors: K. Appert 
Publication date: 9 August 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90041-9
Recommendations
Cites Work
- The superconnectivity of large digraphs and graphs
- Synthesis of reliable networks - a survey
- Line Digraph Iterations and the (d, k) Digraph Problem
- Dense bipartite digraphs
- Title not available (Why is that?)
- Maximally connected digraphs
- Lower-bounds on the connectivities of a graph
- On the linegraph of a directed-graph
- Bipartite graphs and digraphs with maximum connectivity
- On super-edge-connected digraphs and bipartite digraphs
- Connectivity of Regular Directed Graphs with Small Diameters
- Large fault-tolerant interconnection networks
- Sufficient conditions for maximally connected dense graphs
- Title not available (Why is that?)
- On the distance connectivity of graphs and digraphs
- Super edge-connectivity of dense digraphs and graphs
- Connectivity of large bipartite digraphs and graphs
- The connectivity of large digraphs and graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (25)
- A characterization of graphs by codes from their incidence matrices
- Sufficient conditions for a graph to be super restricted edge-connected
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Title not available (Why is that?)
- Super-pancyclic hypergraphs and bipartite graphs
- Title not available (Why is that?)
- All (k;g)‐cages are edge‐superconnected
- Diameter, short paths and superconnectivity in digraphs
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
- Restricted arc-connectivity of generalized \(p\)-cycles
- The superconnectivity of large digraphs and graphs
- Sufficient conditions for \(k\)-restricted edge connected graphs
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- Title not available (Why is that?)
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- Sufficient conditions for super-arc-strongly connected oriented graphs
- Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Maximally and super connected multisplit graphs and digraphs
- Super-arc-connectivity properties of strongly connected digraphs
- On the superconnectivity and the conditional diameter of graphs and digraphs
- Super-connected and hyper-connected jump graphs
- Inverse degree and super edge-connectivity
- Neighborhood conditions for graphs to be super restricted edge connected
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)
