Tight distance-regular graphs and the Q-polynomial property
Let Γ denote a distance-regular graph with diameter d ≥ 3, and assume Γ is tight (in the sense of Jurišić, Koolen and Terwilliger). Let θ denote the second largest or smallest eigenvalue of Γ, and let σ0, σ1, . . . , σd denote the associated cosine sequence. We obtain an inequality involving σ0, σ1,...
Saved in:
Main Author: | Pascasio, Arlene A. |
---|---|
Format: | text |
Published: |
Animo Repository
2001
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/3622 https://animorepository.dlsu.edu.ph/context/faculty_research/article/4624/type/native/viewcontent/s003730170063.html |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
A characterization of Q-polynomial distance-regular graphs
by: Pascasio, Arlene A.
Published: (2008) -
On the multiplicities of the primitive idempotents of a Q-polynomial distance-regular graph
by: Pascasio, Arlene A.
Published: (2002) -
On chromatic polynomials of regular graphs and modified wheels
by: Aves, Lovelina A.
Published: (1994) -
The terwilliger algebra of a distance-regular graph
by: Go, Junie T.
Published: (1999) -
Tight distance-regular graphs and the subconstituent algebra
by: Go, Junie T., et al.
Published: (2002)