The minumum geodetic communication overlap graphs Original Research Article

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