Distance-regular graphs with classical parameters that support a uniform structure: case \(q \geq 2\)

DOI10.1016/j.disc.2024.114263MaRDI QIDQ6635114

Giusy Monzillo, Štefko Miklavič, Roghayeh Maleki, Blas Fernández

Publication date: 9 November 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Terwilliger algebradistance-regular graphsuniform posets

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorics of partially ordered sets (06A07) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. II
• A new feasibility condition for distance-regular graphs
• Strongly regular graphs with smallest eigenvalue -m
• Homogeneous graphs and regular near polygons
• Tight distance-regular graphs
• The folded \((2D+1)\)-cube and its uniform posets
• 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
• Dual polar graphs, the quantum algebra \(U_q(\mathfrak{sl}_{2})\), and Leonard systems of dual \(q\)-Krawtchouk type
• Distance-regular graphs with classical parameters that support a uniform structure: case \(q \leq 1\)

This page was built for publication: Distance-regular graphs with classical parameters that support a uniform structure: case \(q \geq 2\)