Bipartite graphs and digraphs with maximum connectivity

DOI10.1016/0166-218X(95)00097-BzbMath0857.05063MaRDI QIDQ1923586

J. Fàbrega, Miquel Àngel Fiol

Publication date: 6 March 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphdiametervertex connectivityedge connectivitysuperconnectivities

Mathematics Subject Classification ID

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

Related Items (20)

Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ Superconnected digraphs and graphs with small conditional diameters ⋮ Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ On super-edge-connected digraphs and bipartite digraphs ⋮ Lower connectivities of regular graphs with small diameter ⋮ A characterization of graphs by codes from their incidence matrices ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs ⋮ Codes from incidence matrices of graphs ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ On local connectivity of graphs ⋮ On local connectivity of graphs with given clique number ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\) ⋮ Degree sequence conditions for maximally edge-connected oriented graphs ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ On the connectivity of \(p\)-diamond-free graphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments ⋮ On the distance connectivity of graphs and digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• Large fault-tolerant interconnection networks
• Results on the edge-connectivity of graphs
• On the linegraph of a directed-graph
• Line Digraph Iterations and the (d, k) Digraph Problem
• Maximally connected digraphs
• The connectivity of large digraphs and graphs
• Dense bipartite digraphs
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs

This page was built for publication: Bipartite graphs and digraphs with maximum connectivity