A spectral characterization of strongly distance-regular graphs with diameter four
classification
🧮 math.CO
keywords
distance-regularstronglydiametergraphscharacterizationgraphspectralantipodal
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.