On graphs with equal edge connectivity and minimum degree
Abstract
The note contains some conditions on a graph implying that the edge connectivity is equal to the minimum degree. One of these conditions is that if d1≥d2≥⋯≥dn is the degree sequence then ∑ll-1(d1+dn-1)>In-1 for 1 ≤ l≤ min { n 2-1, dn}. © 1979.
Publication Title
Discrete Mathematics
Recommended Citation
Bollobás, B. (1979). On graphs with equal edge connectivity and minimum degree. Discrete Mathematics, 28 (3), 321-323. https://doi.org/10.1016/0012-365X(79)90139-0
COinS
