Geodetic blocks of diameter three (Q759769)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Geodetic blocks of diameter three |
scientific article; zbMATH DE number 3882472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Geodetic blocks of diameter three |
scientific article; zbMATH DE number 3882472 |
Statements
Geodetic blocks of diameter three (English)
0 references
1984
0 references
A graph is said to be geodetic if any two vertices are joined by a unique shortest path. The authors show that every geodetic block G of diameter 3 is self-centred (i.e. every vertex has eccentricity 3), upper and lower geodetic critical (i.e. \(G+e\) and G-e \((G\neq C_ 7)\) are not geodetic graphs) and lower diameter critical (i.e. \(diam(G-e)>3\)). Also further results are given.
0 references
geodetic
0 references
geodetic critical
0 references
diameter critical
0 references
0.8529277443885803
0 references
0.8437873721122742
0 references
0.8378211855888367
0 references
