A new infinite series of regular uniformly geodetic code graphs
✍ Scribed by A.E. Brouwer; J.H. Koolen
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 481 KB
- Volume
- 120
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
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 geodetic in the sense of Cook and Pryce (1983) (F-geodetic in the sense of Ceccharini and Sappa (1986)), i.e., the nu mber of geodesics between any two vertices only depends on their distance (and equals 4 when this distance is two). They are counterexamples to Theorem 3.15.1 of [I], and we show that there are no other counterexamples.