Superconnectivity of bipartite digraphs and graphs

Discrete Mathematics

Volumn 197-198, Issue , 1999, Pages 61-75

  Balbuena, C ^a   Carmona, A ^a   Fabrega J ^a   Fiol, M A ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Bipartite (directed) graph; Diameter; Girth; Line digraph; Order; Superconnectivity

Indexed keywords

EID: 0009088359     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0012-365x(99)90041-9     Document Type: Article

References (22)

1. M. Aigner, On the linegraph of a directed graph, Math. Z. 102 (1967) 56-61.
2. C. Balbuena, A. Carmona, J. Fàbrega, M.A. Fiol, Connectivity of large bipartite digraphs and graphs, Discrete Math. 174 (1997) 3-17.
3. J.-C. Bermond, N. Homobono, C. Peyrat, Large fault-tolerant interconnection networks, Graphs Combin. 5 (1989) 107-123.
4. F.T Boesch, Synthesis of reliable networks - a survey, IEEE Trans. Reliab. 35 (1986) 240-246.
5. G. Chartrand, L. Lesniak, Graphs and Digraphs. Wadsworth, Monterey, CA, 1986.
6. A.H. Esfahanian, Lower-bounds on the connectivities of a graph, J. Graph Theory 9 (1985) 503-511.
7. J. Fàbrega, M.A. Fiol, Maximally connected digraphs, J. Graph Theory 13 (1989) 657-668.
8. J. Fàbrega, M.A. Fiol, Bipartite graphs and digraphs with maximum connectivity, Discrete Appl. Math. 69 (1996) 269-278.
9. M.A. Fiol, Connectivity and superconnectivity of large graphs and digraphs, Ars Combin. 29 B (1990) 5-16.
10. M.A. Fiol, On super-edge-connected digraphs and bipartite digraphs, J. Graph Theory 16 (1992) 545-555.
11. M.A. Fiol, The connectivity of large digraphs and graphs, J. Graph Theory 17 (1993) 31-45.
12. M.A. Fiol, Superconnectivity of large graphs and digraphs, Discrete Math. 124 (1994) 67-78.
13. M.A. Fiol, J. Fàbrega, On the distance connectivity of graphs and digraphs, Discrete Math. 125 (1994) 169-176.
14. M.A. Fiol, J. Fàbrega, M. Escudero, Short paths and connectivity in graphs and digraphs, Ars Combin. 29 B (1990) 17-31.
15. M.A. Fiol, J.L.A. Yebra, Dense bipartite digraphs, J. Graph Theory 14 (1990) 687-700.
16. M.A. Fiol, J.L.A. Yebra, I. Alegre, Line digraph iterations and the (d,k) digraph problem, IEEE Trans. Comput. C-33 (1984) 400-403.
17. F. Harary, R.Z. Norman, D. Cartwright, Introduction à la Théorie des Graphes Orientés, Dunod, Paris, 1968.
18. M. Imase, T. Soneoka, K. Okada, Connectivity of regular directed graphs with small diameter, IEEE Trans. Comput. C-34 (1985) 267-273.
19. S.M. Reddy, J.G. Kuhl, S.H. Hosseini, H. Lee, On digraphs with minimum diameter and maximum connectivity, Proc. 20th Annual Allerton Conf., 1982, pp. 1018-1026.
20. T. Soneoka, Super edge-connectivity of dense digraphs and graphs, Discrete Appl. Math. 37/38 (1992) 511-523.
21. T. Soneoka, H. Nakada, M. Imase, Sufficient conditions for dense graphs to be maximally connected, Proc. ISCAS85, 1985, pp. 811-814.
22. T. Soneoka, H. Nakada, M. Imase, C. Peyrat, Sufficient conditions for maximally connected dense graphs, Discrete Math. 63 (1987) 53-66.