Pseudo 1-homogeneous distance-regular graphs

DOI10.1007/s10801-007-0115-yzbMath1160.05060OpenAlexW2066660151MaRDI QIDQ1016027

Aleksandar Jurišić, Paul M. Terwilliger

Publication date: 4 May 2009

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-007-0115-y

zbMATH Keywords

distance-regular graphslocally strongly regularprimitive idempotentscosine sequencepseudo primitive idempotent1-homogeneous propertypseudo 1-homogeneoustight distance-regular graphtight edges

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items (2)

Pseudo primitive idempotents and almost 2-homogeneous bipartite distance-regular graphs ⋮ Bipartite distance-regular graphs and taut pairs of pseudo primitive idempotents

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight graphs and their primitive idempotents
• Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra.
• Tight distance-regular graphs
• 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
• An inequality involving the local eigenvalues of a distance-regular graph
• The subconstituent algebra of a distance-regular graph; thin modules with endpoint one
• Tight distance-regular graphs and the subconstituent algebra
• A local approach to 1-homogeneous graphs

This page was built for publication: Pseudo 1-homogeneous distance-regular graphs