Which of these is true about the diameter of a graph GGG?
It is the length of the longest shortest path between any two vertices.
It is the longest path in the graph.
It is the distance of the furthest vertex from a central node.
It only exists for connected graphs.