A simple undirected finite graph G has the me_2-property if every pair of distinct vertices of G is connected by a path of length 2, but this property does not survive the deletion of an edge. If u and v are adjacent ...