# Diameter of a Graph

Jump to navigation
Jump to search

The diameter of the graph is the largest number of vertices which must be travelled to traverse from any one vertex to any other vertex.

From Algorithmist

Jump to navigation
Jump to search
The diameter of the graph is the largest number of vertices which must be travelled to traverse from any one vertex to any other vertex.

- Not logged in
- Talk
- Contributions
- Create account
- Log in

- This page was last edited on 11 October 2010, at 15:18.
- Content is available under GNU Free Documentation License 1.2 unless otherwise noted.