Geodetic blocks of diameter three (Q759769): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:25, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Geodetic blocks of diameter three |
scientific article |
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