Geodetic blocks of diameter three (Q759769): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A class of geodetic blocks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3291034 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some general constructions of geodetic blocks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An extremal problem in geodetic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4116463 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geodetic graphs of diameter two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On planar geodetic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4068756 / rank | |||
Normal rank | |||
Latest revision as of 16:23, 14 June 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
