Highly Influenced

2 Excerpts

@article{Hamidoune1980APO, title={A property of a-fragments of a digraph}, author={Yahya Ould Hamidoune}, journal={Discrete Mathematics}, year={1980}, volume={31}, pages={105-106} }

- Published in Discrete Mathematics 1980
DOI:10.1016/0012-365X(80)90180-6

Chartrand proved in [2] that a simple graph G of order n and with minimal degree not less than $( n 1) has edge-connectivity equals to Min(d(x); x 61 G). Lesniak proved in [4] that a simple graph of order n such that &(x) + &( y) 2 n I for any two non adjacent vertices x and y of G has edge-connectivity equals to Min(d(x); x E G). The above two results can be deduced easily from the following theorem of Jolivet. Every digraph of diameter 2”has arc-connectivity equals to Min(G+( G), S-(G)). ILet… CONTINUE READING