“…Similarly, the distance-i-or-j graph is the graph Γ i,j with the same vertices as Γ and in which two vertices are adjacent if and only if they are at distance i or j in Γ. In the recent works of Brouwer and Fiol [4,15], it was studied the situation in which the distance-d graph Γ d of Γ (or the Kneser graph K of Γ) with adjacency matrix A d (= p d (A)), where p d is the distance-d polynomial, has fewer distinct eigenvalues than Γ. Examples are the so-called half antipodal (K with only one negative eigenvalue, up to multiplicity), and antipodal distance-regular graphs (where K consists of disjoint copies of a complete graph).…”