Geodetic blocks of diameter three
type: Item
instance of: scholarly article
title: Geodetic blocks of diameter three
zbMATH Open document ID: 0554.05043
DOI: 10.1007/BF02579221
author: D. Kharzeev
published in: Combinatorica
publication date: 1984-01-01T00:00:00Z
review text: 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.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3882472
zbMATH Keywords: geodetic
zbMATH Keywords: geodetic critical
zbMATH Keywords: diameter critical
MaRDI profile type: Publication
cites work: A class of geodetic blocks
cites work: Q3291034
cites work: Some general constructions of geodetic blocks
cites work: An extremal problem in geodetic graphs
cites work: Q4116463
cites work: Geodetic graphs of diameter two
cites work: On planar geodetic graphs
cites work: Q4068756
description: scientific article; zbMATH DE number 3882472