Definition: The maximum of the distances between all possible pairs of vertices of a graph.
See also degree.
Note: The distance between two vertices u and v in a weighted graph is the sum of weights of the edges of a shortest path between them. For unweighted graph, it is the number of edges of a shortest path.
From Algorithms and Theory of Computation Handbook, page 20-26, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 4 January 2005.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "diameter", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 4 January 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/diameter.html