|
The diameter of a graph is the distance between the two vertices which are furthest from each other. The distance between two vertices a and b is the minimum number of edges that one has to follow to get from a to b. |
|
The diameter of a graph is the distance between the two vertices which are furthest from each other. The distance between two vertices a and b is the minimum number of edges that one has to follow to get from a to b. The two definitions given above are special cases of a more general definition. The diameter of a subset of a metric space is the least upper bound of the distances between pairs of points in the subset. So, if A is the subset, the diameter is :sup { d(x, y) | x, y in A }. |
![[Home]](wikipedia.png)