Bipartite graphs and digraphs with maximum connectivity

Citations of this article
Mendeley users who have this article in their library.


Recently, some sufficient conditions for a digraph to have maximum connectivity or high superconnectivity have been given in terms of a new parameter which can be thought of as a generalization of the girth of a graph. In this paper similar results are derived for bipartite digraphs and graphs showing that, in this case, all the known conditions can be improved. As a corollary, it is shown that any bipartite graph of girth g and diameter D ≤ g - 2 (respectively D≤g -1) has maximum vertex-connectivity (respectively maximum edge-connectivity). This implies a result of Plesnik and Znám stating that any bipartite graph with diameter three is maximally edge-connected. © 1996 Elsevier Science B.V.




Fàbrega, J., & Fiol, M. A. (1996). Bipartite graphs and digraphs with maximum connectivity. Discrete Applied Mathematics, 69(3), 271–279.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free