Deleting an edge from a connected graph can never end in a graph which has much more than two linked elements.In graph G, length between v1 and v2 is two. As the shortest path Among the many two paths v1– v4– v2 and v1– v3– v5– v2 among v1 and v2 is of size 2.Enhance the write-up with the know-how. Contribute to your GeeksforGe