The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues
Rights accessOpen Access
Let G be a distance-regular graph with diameter d and Kneser graph K=Gd, the distance-d graph of G. We say that G is partially antipodal when K has fewer distinct eigenvalues than G. In particular, this is the case of antipodal distance-regular graphs (K with only two distinct eigenvalues), and the so-called half-antipodal distance-regular graphs (K with only one negative eigenvalue). We provide a characterization of partially antipodal distance-regular graphs (among regular graphs with d distinct eigenvalues) in terms of the spectrum and the mean number of vertices at maximal distance d from every vertex. This can be seen as a general version of the so-called spectral excess theorem, which allows us to characterize those distance-regular graphs which are half-antipodal, antipodal, bipartite, or with Kneser graph being strongly regular.
CitationFiol, M. The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues. "Electronic notes in discrete mathematics", 01 Gener 2015, vol. 49, p. 457-463.