Superconnectivity of bipartite digraphs and graphs

DOI10.1016/S0012-365X(99)90041-9zbMath0933.05089OpenAlexW4213246652MaRDI QIDQ1292813

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

zbMATH Keywords

bipartite graphsbipartite digraphsuperconnectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (16)

Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs ⋮ A characterization of graphs by codes from their incidence matrices ⋮ Sufficient conditions for a graph to be super restricted edge-connected ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ On the superconnectivity and the conditional diameter of graphs and digraphs ⋮ Super-connected and hyper-connected jump graphs ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ Inverse degree and super edge-connectivity ⋮ Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ All (k;g)‐cages are edge‐superconnected ⋮ Sufficient conditions for super-arc-strongly connected oriented graphs ⋮ A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected ⋮ Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• Large fault-tolerant interconnection networks
• Super edge-connectivity of dense digraphs and graphs
• The superconnectivity of large digraphs and graphs
• On the distance connectivity of graphs and digraphs
• Connectivity of large bipartite digraphs and graphs
• Bipartite graphs and digraphs with maximum connectivity
• On the linegraph of a directed-graph
• Connectivity of Regular Directed Graphs with Small Diameters
• Line Digraph Iterations and the (d, k) Digraph Problem
• Synthesis of reliable networks - a survey
• Lower-bounds on the connectivities of a graph
• On super-edge-connected digraphs and bipartite digraphs
• Maximally connected digraphs
• The connectivity of large digraphs and graphs
• Dense bipartite digraphs

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