The distance between two vertices of a simple connected graph G, denoted as (Formula presented.), is the length of the shortest path from u to v and is always symmetrical. An ordered subset (Formula presented.) of (Formula ...