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.
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.