For a connected graph , an edge set is a k-restricted-edge-cut, if is disconnected and every component of has at least k vertices. The k-restricted-edge-connectivity of G, denoted by , is defined as the cardinality of a minimum k-restricted-edge-cut. The k-isoperimetric-edge-connectivity is defined as , where is the set of edges with one end in U and the other end in ⧹. In this note, we give some degree conditions for a graph to have optimal and/or .