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

preprint2014arXivOpen access

Abstract

A graph GG with d+1d+1 distinct eigenvalues is called strongly distance-regular if GG itself is distance-regular, and its distance-dd graph GdG_d is strongly-regular. In this note we provide a spectral characterization of those distance-regular graphs with diameter d=4d=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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.