A spectral characterization of strongly distance-regular graphs with diameter four
M.A. Fiol

TL;DR
This paper provides a spectral characterization of strongly distance-regular graphs with diameter four, revealing that bipartite cases are antipodal, thus advancing understanding of their structural properties.
Contribution
It introduces a spectral criterion for identifying strongly distance-regular graphs with diameter four and shows bipartite cases are antipodal, a novel structural insight.
Findings
Spectral characterization for diameter four strongly distance-regular graphs
Bipartite strongly distance-regular graphs with diameter four are antipodal
Enhanced understanding of the structure of these graphs
Abstract
A graph with distinct eigenvalues is called strongly distance-regular if itself is distance-regular, and its distance- graph is strongly-regular. In this note we provide a spectral characterization of those distance-regular graphs with diameter which are strongly distance-regular. As a byproduct, it is shown that all bipartite strongly distance-regular graphs with such a diameter are antipodal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Graph theory and applications · Nuclear Receptors and Signaling
