It is the number of vertices in the longest path.

It is the maximum of all shortest path distances between any pair of vertices.

It is the total number of edges in the graph.

It is always equal to the number of vertices minus one.