On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs

Ars Combinatoria

Volumn 61, Issue , 2001, Pages 3-21

  Balbuena, C ^a   Carmona, A ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037904776     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. K.S. Bagga, L.W. Beineke, W. D. Goddard, M.J. Lipman and R.E. Pippert, A survey of integrity. Discrete Appl. Math. 37/38 (1992) 13-28.
2. K.S. Bagga, L.W. Beineke, , M.J. Lipman and R.E. Pippert, Edge-integrity: a survey. Discrete Math. 124 (1994) 3-12.
3. C. Balbuena, A. Carmona, J. Fàbrega, M. A. Fiol, On the order and size of s-geodetic digraphs with given connectivity. Discrete Math. 174 (1997) 19-27.
4. C. Balbuena, A. Carmona, J. Fàbrega, M. A. Fiol, Connectivity of large bipartite digraphs and graphs. Discrete Math. 174 (1997) 3-17.
5. C. Balbuena, A. Carmona, J. Fàbrega, M. A. Fiol, Superconnectivity of bipartite digraphs and graphs. Discrete Math. 197/198 (1999) 61-75.
6. C. Balbuena, A. Carmona, J. Fàbrega, M. A. Fiol, Extraconnectivity of graphs with large minimum degree and girth. Discrete Math. 167/168 (1997) 85-100.
7. J.-C. Bermond, N. Homobono, and C. Peyrat, Large fault-tolerant interconnection networks. Graphs and Combinatorics 5 (1989) 107-123.
8. F. Boesch and H. Tindell, Circulants and their connectivities. J. Graph Theory. 8 (1984) 487-499.
9. B. Bollobás, Extremal graph theory. Academic Press (1978).
10. J. Bond and C. Delorme, New large bipartite graphs with given degree and diameter. Ars Combin. 25C (1988) 123-132.
11. G. Chartrand, A graph-theoretic approach to a communications problem. SIAM J. Appl. Math. 14 (1966) 778-781.
12. P. Dankelmann and L. Volkmann, New sufficient conditions for equality of minimum degree and edge-connectivity. Ars Combinatoria 40 (1995), 270-278.
13. J. Fàbrega and M. A. Fiol, Maximally connected digraphs. J. Graph Theory 13 (1989) 657-668.
14. J. Fàbrega and M. A. Fiol, On the extraconnectivity of graphs. Discrete Math. 155 (1996) 49-57.
15. M. A. Fiol and J. Fàbrega and, On the distance connectivity of graphs and digraphs. Discrete Math. 125 (1994) 169-176.
16. M.A. Fiol, On super-edge-connected digraphs and bipartite digraphs. J. Graph Theory 16 (1992) 545-555.
17. M.A. Fiol, The connectivity of large digraphs and graphs. J. Graph Theory 17 (1993) 31-45.
18. M.A. Fiol, J. Fàbrega and M. Escudero, Short paths and connectivity in graphs and digraphs. Ars Combin. 29B (1990) 17-31.
19. D. Geller and F. Harary, Connectivity in digraphs. Lec. Not. Math. 186, Springer, Berlin (1970) 105-114.
20. Y.O. Hamidoune, A property of α-fragments of a digraph. Discrete Math. 31 (1980) 105-106.
21. Y.O. Hamidoune, Sur les atomes d'un graphe orienté. C.R. Acad. Sc. Paris, 284-A (1977) 1253-1256.
22. Y.O. Hamidoune, A.S. Lladó and O. Serra, Vosperian and superconnected abelian Cayley digraphs. Graphs and Combinatorics 7 (1991) 143-152.
23. M. Imase, T. Soneoka, and K. Okada, Connectivity of regular directed graphs with small diameter. IEEE Trans. Comput. C-34 (1985), 267-273
24. L. Lesniak, Results on the edge-connectivity of graphs. Discrete Math. 8 (1974) 351-354.
25. J. Plesník and Š. Znám, Strongly geodetic directed graphs. Acta Fac. Rerum Natur. Univ. Comenian., Math. Publ. 29 (1974) 29-34.
26. Soneoka, Nakada, Imase, Sufficient conditions for maximally connected dense graphs. Discrete Math., 63 (1987) 53-66.
27. Topp and L. Volkmann, Sufficient conditions for equality of connectivity and minimum degree of a grap. J. Graph Theory 17 (1993), 695-700
28. L. Volkmann, Edge-connectivity in p-partite graphs. J. Graph Theory 13 (1989), 1-6.