Tight graphs and their primitive idempotents

DOI10.1023/A:1018624103247zbMath0927.05085MaRDI QIDQ1296388

Arlene A. Pascasio

Publication date: 5 December 1999

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

zbMATH Keywords

eigenvaluesdistance regular graphprimitive idempotenttight graphKrein parameter

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (14)

Light tails and the Hermitian dual polar graphs ⋮ Twice \(Q\)-polynomial distance-regular graphs of diameter 4 ⋮ The subconstituent algebra of a strongly regular graph ⋮ The pseudo-cosine sequences of a distance-regular graph ⋮ Leaves in representation diagrams of bipartite distance-regular graphs ⋮ Pseudo primitive idempotents and almost 2-homogeneous bipartite distance-regular graphs ⋮ An inequality on the cosines of a tight distance-regular graph ⋮ Taut distance-regular graphs and the subconstituent algebra ⋮ Distance-regular graphs with light tails ⋮ Pseudo 1-homogeneous distance-regular graphs ⋮ Taut distance-regular graphs of even diameter ⋮ A distance regular graph of type \(E_1\circ E_d\) ⋮ Tight distance-regular graphs and the subconstituent algebra ⋮ Taut distance-regular graphs of odd diameter

Cites Work

• Problems in algebraic combinatorics
• Tight distance-regular graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Tight graphs and their primitive idempotents