A new upper bound on the number of edges in a geodetic graph (Q1301713): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(98)00353-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163226167 / rank | |||
Normal rank | |||
Revision as of 11:10, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound on the number of edges in a geodetic graph |
scientific article |
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
