Taut distance-regular graphs and the subconstituent algebra
Mark S. MacLean, Paul Terwilliger
Abstract
We consider a bipartite distance-regular graph G with diameter D at least 4 and valency k at least 3. We obtain upper and lower bounds for the local eigenvalues of G in terms of the intersection numbers of G and the eigenvalues of G. Fix a vertex of G and let T denote the corresponding subconstituent algebra. We give a detailed description of those thin irreducible T-modules that have endpoint 2 and dimension D-3. In an earlier paper the first author defined what it means for G to be taut. We obtain three characterizations of the taut condition, each of which involves the local eigenvalues or the thin irreducible T-modules mentioned above.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.