We develop further the communication overlap index of Hong and Zuo in
the case where the points of the graph communicate with each other thr
ough shortest paths (geodesics) of the graph. The structure of the gra
phs with minimum geodetic communication index is described, the concep
t of geodetic connectivity of a graph introduced, and a condition for
testing the geodetic connectivity of a graph given.