We construct vertex-transitive graphs r, regular of valency k = n\* + n + 1 on Y =2(y) vertices, with integral spectrum, possessing a distinguished complete matching such that contracting the edges of this matching yields the Johnson graph J(2n, n) (of valency n'). These graphs are uniformly geodeti
On uniformly geodetic graphs
โ Scribed by J. H. Koolen
- Publisher
- Springer Japan
- Year
- 1993
- Tongue
- English
- Weight
- 432 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We study the graphs in which the number of geodesics between any two vertices depends only on their distance. We consider also a connection between some of these graphs and geodetic graphs.
A graph can be metrized by assigning a length to each of its edges. Such a graph is said to be geodetic if for each pair of vertices there is a unique geodesic joining them. It is said to be normally geodetic if each of these unique geodesics is one of the geodesics in the usual metrization of the g
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new strong necessary condition for the existence of such graphs.