摘要
We only discuss finite undirected simple graph.Suppose graph G is connected. If for each pair of vertices x and y of G there is the unique shortest path which connects x and y, then G is called geodetic graph. If G is 2-connected geodetic graph, then G is called geodetic block.
基金
Project supported by the National Natural Science Foundation of China.
