2000 character limit reached
A spectral characterization of strongly distance-regular graphs with diameter four
Published 5 Jul 2014 in math.CO | (1407.1392v1)
Abstract: A graph $G$ with $d+1$ distinct eigenvalues is called strongly distance-regular if $G$ itself is distance-regular, and its distance-$d$ graph $G_d$ is strongly-regular. In this note we provide a spectral characterization of those distance-regular graphs with diameter $d=4$ which are strongly distance-regular. As a byproduct, it is shown that all bipartite strongly distance-regular graphs with such a diameter are antipodal.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.