How many kinds of distance defined on graph in graph theory?

1- The distance between any two vertices u and v, denoted d(u, v), is the length of a shortest u − v path, also called a u − v geodesic. 2- Suppose G is a (weighted) graph and S a set of vertices...

04 April 2017 4,719 5 View