diameter

The diameter of a connected graph (or multigraph or pseudograph) is the largest distance that occurs in it.

Here distance, between two nodes (vertices), refers to the length of the shortest path between them.

In disconnected graphs the diameter is undefined (sometimes it is said to be infinite).