Edges of degree kk in minimally restricted kk-edge connected graphs

For a connected graph G=(V,E)G=(V,E), an edge set S⊂ES⊂E is a restricted edge cut if G−SG−S is disconnected and there is no isolated vertex in G−SG−S. The cardinality of a minimum restricted edge cut of GG is the restricted edge connectivity of GG, denoted by λ′(G)λ′(G). A graph GG is called minimally restricted kk-edge connected if λ′(G)=kλ′(G)=k and λ′(G−e)