2015
DOI: 10.1007/s10801-015-0654-6
|View full text |Cite
|
Sign up to set email alerts
|

The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues

Abstract: The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-015-0654-6Let Gamma be a distance-regular graph with diameter d and Kneser graph K = Gamma(d), the distance-d graph of Gamma. We say that Gamma is partially antipodal when K has fewer distinct eigenvalues than Gamma. In particular, this is the case of antipodal distance-regular graphs (K with only two distinct eigenvalues) and the so-called half-antipodal distance-regular graphs (K with only one negative eigenvalue). We provide… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…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).…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…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).…”
Section: Preliminariesmentioning
confidence: 99%
“…Notice that, in this case, Γ 1,2 is strongly regular if and only if its complement Γ 3 is. As commented in the Introduction, the last case was studied for general diameter by Brouwer and Fiol [4] and Fiol [15]. (i) The distance-2 graph Γ 2 is strongly regular if and only if a 2 − c 3 is an eigenvalue of Γ.…”
Section: The Case Of Distance-regular Graphsmentioning
confidence: 99%