Taut distance-regular graphs of even diameter
From MaRDI portal
Publication:1826959
DOI10.1016/j.jctb.2003.11.002zbMath1047.05044OpenAlexW2046962284MaRDI QIDQ1826959
Publication date: 6 August 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2003.11.002
Related Items
The pseudo-cosine sequences of a distance-regular graph ⋮ Leaves in representation diagrams of bipartite distance-regular graphs ⋮ Taut distance-regular graphs and the subconstituent algebra ⋮ Distance-regular graphs with light tails ⋮ Tight distance-regular graphs and the subconstituent algebra
Cites Work
- Unnamed Item
- Unnamed Item
- The subconstituent algebra of an association scheme. I
- Distance-regular graphs and halved graphs
- Tight graphs and their primitive idempotents
- Homogeneous graphs and regular near polygons
- Problems in algebraic combinatorics
- Krein parameters and antipodal tight graphs with diameter 3 and 4
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- 2-homogeneous bipartite distance-regular graphs
- Nonexistence of some antipodal distance-regular graphs of diameter four
- An inequality involving two eigenvalues of a bipartite distance-regular graph
- Tight distance-regular graphs
- Dual bipartite Q-polynomial distance-regular graphs
- An inequality in character algebras
- Taut distance-regular graphs of odd diameter
- Spin models on bipartite distance-regular graphs
- A local approach to 1-homogeneous graphs
- An inequality on the cosines of a tight distance-regular graph
- Tight distance-regular graphs and the \(Q\)-polynomial property
- On the primitive idempotents of distance-regular graphs
