Graphs with odd distances between cut and non-cut vertices

A vertex u in a nite connected graph G is called a cut vertex if its removal results in a disconnected graph G − u. A graph is biconnected provided it does not contain cut vertices. In, connected graphs with even distances between their non-cut vertices (NCE-graphs) and graphs with these odd distances (NCO-graphs) were considered.