An antipodal distance-regular graph of diameter four or five is a covering graph of a connected strongly regular graph. We give existence conditions for these graphs and show for some types of strongly regular graphs that no nontrivial covers exist.
Nonexistence of some Antipodal Distance-regular Graphs of Diameter Four
✍ Scribed by Aleksandar Jurišić; Jack Koolen
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 160 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
We find an inequality involving the eigenvalues of a regular graph; equality holds if and only if the graph is strongly regular. We apply this inequality to the first subconstituents of a distance-regular graph and obtain a simple proof of the fundamental bound for distance-regular graphs, discovered by Jurišić, Koolen and Terwilliger. Using this we show that for distance-regular graphs with certain intersection arrays, the first subconstituent graphs are strongly regular. From these results we prove the nonexistence of distance-regular graphs associated to 20 feasible intersection arrays from the book Distance-Regular Graphs by Brouwer, Cohen and Neumaier [3].
📜 SIMILAR VOLUMES
Let G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if G has a distance-regular antipodal cover of diameter 4, then k ≤ 2(n + 1)/5 , unless G is the complement of triangular graph T (7), the folded Johnson graph J (8, 4) or the folded halved 8-cube. However, for
Let 1 denote a bipartite Q-polynomial distance-regular graph with diameter D 4. We show that 1 is the quotient of an antipodal distance-regular graph if and only if one of the following holds. (i) 1 is a cycle of even length. (ii) 1 is the quotient of the 2D-cube. 1999 Academic Press \* , ..., %\