A new upper bound on the number of edges in a geodetic graph (Q1301713)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1334526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new upper bound on the number of edges in a geodetic graph |
scientific article; zbMATH DE number 1334526 |
Statements
A new upper bound on the number of edges in a geodetic graph (English)
0 references
29 November 1999
0 references
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]\).
0 references
central geodetic block
0 references
number of edges
0 references
upper bound
0 references
0.8427350521087646
0 references
0.8306205868721008
0 references
0.8028758764266968
0 references
