i dont know why u r confuse even though u already explained concept..
see Edge connectivity is minimum number of edges removed in order to disconnect a graph. now we have to delete minimum number of edges then try for those vertices which is associated with minimum number of edges i.e. degree of that vertex should be minimum.
Note : a bridge in graph results edge connectivity to 1, which is less than minimum degree of any vertex.