On the connectivity and the conditional diameter of graphs and digraphs

Networks

Volumn 28, Issue 2, 1996, Pages 97-105

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

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039862238     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199609)28:2<97::AID-NET3>3.0.CO;2-7     Document Type: Article

References (27)

1. J. N. Ayoub and I. T. Frisch, On the smallest-branch cuts in directed graphs. IEEE Trans. Circuit Theory CT-17 (1970) 249-250.
2. M. C. Balbuena, A. Carmona, and M. A. Fiol, Distance connectivity in graphs and digraphs. J. Graph Theory, to appear.
3. M. C. Balbuena, A. Carmona, J. Fàbrega, and M. A. Fiol, Connectivity of large bipartite digraphs and graphs. Discr. Math., to appear.
4. M. C. Balbuena, A. Carmona, J. Fàbrega, and M. A. Fiol, On the order and size of s-geodetic digraphs with given connectivity. Discr. Math., to appear.
5. J.-C. Bermond, N. Homobono, and C. Peyrat, Large fault-tolerant interconnection networks. Graphs Comb. 5 (1989) 107-123.
6. J. Bond and C. Delorme, New large bipartite graphs with given degree and diameter. Ars Comb. 25C (1988) 123-132.
7. L. Cacceta and R. Häggkvist, On minimal digraphs of given girth. Proceedings of the Ninth Southeastern Conference on Combinatories, Graph Theory and Computing, Utilitas Mathematica, Winnipeg (1978) 181-187.
8. G. Chartrand, A graph-theoretic approach to a communications problem. SIAM J. Appl. Math. 14 (1966) 778-781.
9. G. Chartrand and L. Lesniak, Graphs and Digraphs. Wadsworth, Monterey (1986).
10. A. H. Esfahanian, Lower-bounds on the connectivities of a graph. J. Graph Theory 9 (1985) 503-511.
11. J. Fàbrega and M. A. Fiol, Maximally connected digraphs. J. Graph Theory 13 (1989) 657-668.
12. J. Fàbrega and M. A. Fiol, Bipartite graphs and digraphs with maximum connectivity. Discr. Appl. Math., to appear.
13. M. A. Fiol, The connectivity of large digraphs and graphs. J. Graph Theory 17 (1993) 31-45.
14. M. A. Fiol, J. Fàbrega, and M. Escudero, Short paths and connectivity in graphs and digraphs. Ars Comb. 29B (1990) 17-31.
15. D. Geller and F. Harary, Connectivity in digraphs. Lecture Notes on Mathematics 186, Springer, Berlin (1970) 105-114.
16. D. L. Goldsmith and R. C. Entringer, A sufficient condition for equality of edge-connectivity and minimum degree of a graph. J. Graph Theory 3 (1979) 251-255.
17. D. L. Goldsmith and A. T. White, On graphs with equal edge-connectivity and minimum degree. Discr. Math. 23 (1978) 31-36.
18. Y. O. Hamidoune, An application of connectivity theory in graphs to factorization of elements in groups, Eur. J. Comb. 2 (1981) 349-355.
19. M. Imase, T. Soneoka, and K. Okada, Connectivity of regular directed graphs with small diameter. IEEE Trans. Comput. C-34 (1985) 267-273.
20. J. L. Jolivet, Sur la connexité des graphes orientés. C. R. Acad. Sci. Paris 274A (1972) 148-150.
21. L. Lesniak, Results on the edge-connectivity of graphs. Discr. Math. 8 (1974) 351-354.
22. J. Plesník, Critical graphs of given diameter. Acta Fac. Rerum Natur. Univ. Comenian. Math. 30 (1975) 71-93.
23. J. Plesník and Š. Znám, On equality of edge-connectivity and minimum degree of a graph. Arch. Math. (Brno) 25 (1989) 19-26.
24. T. Soneoka, H. Nakada, and M. Imase, Sufficient conditions for dense graphs to be maximally connected. Proc. ISCAS85 (1985) 811-814.
25. T. Soneoka, H. Nakada, M. Imase, and C. Peyrat, Sufficient conditions for maximally connected dense graphs. Discr. Math. 63 (1987) 53-66.
26. L. Volkmann, Bemerkungen zum p-fachen Kantenzusammenhang von Graphen [Remarks on the p-fold edge connectivity of graphs]. An. Univ. Bucure Mat. 37 (1988) 75-79.
27. L. Volkmann, Edge-connectivity in p-partite graphs. J. Graph Theory 13 (1989) 1-6.