A new upper bound on the number of edges in a geodetic graph (Q1301713): Difference between revisions

A graph is geodetic if the shortest path between any pair of vertices is unique. It is a central geodetic block if each vertex is a center, whence it is 2-connected. It is proven that if in such a graph with \(p\) vertices, \(q\) edges and of diameter \(d\geq 3\), each vertex lies on a cycle of length \(2d+1\), then \(q=p\) or \(q\leq \frac{1}{6}p[p-\frac{1}{2}(5d+1)+8]\).