Tight distance-regular graphs and the subconstituent algebra
We consider a distance-regular graph Γ with diameter D ≥ 3, intersection numbers ai, bi, ciand eigenvalues k = θ0 > θ1 > ⋯ > θD. Let X denote the vertex set of Γ and fix x ∈ X. Let T = T(x) denote the subalgebra of Mat X(C) generated by A, E0 * , E1 * ,⋯ , ED * , where A denotes the adjace...
Saved in:
Main Authors: | Go, Junie T., Terwilliger, Paul |
---|---|
Format: | text |
Published: |
Animo Repository
2002
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/6513 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
The terwilliger algebra of a distance-regular graph
by: Go, Junie T.
Published: (1999) -
On the Terwilliger algebra and quantum adjacency algebra of the Shrikhande graph
by: Morales, John Vincent S., et al.
Published: (2020) -
On distance-regular graphs with Be=1
by: Ramos, Juanita Agbada
Published: (1996) -
Tight distance-regular graphs and the Q-polynomial property
by: Pascasio, Arlene A.
Published: (2001) -
On distance regular graphs with b1=cd-1
by: Cadorniga, Esteinitz G., et al.
Published: (1994)