On automorphisms of distance-regular graphs
β Scribed by A. A. Makhnev
- Publisher
- Springer US
- Year
- 2010
- Tongue
- English
- Weight
- 173 KB
- Volume
- 166
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the
Let Ξ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (Ξ») > n -1, then D β€ d -1, where P is the polynomial of degree d-1 which takes alternating values Β±1 at Ξ» 1 , . . . , Ξ» d . The graphs satisfying P (Ξ») = n -1, called boundary graphs, h