On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph
From MaRDI portal
Publication:6635180
DOI10.37236/12898MaRDI QIDQ6635180
Roghayeh Maleki, Blas Fernández, Giusy Monzillo, Štefko Miklavič
Publication date: 9 November 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Combinatorics of partially ordered sets (06A07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets
- The subconstituent algebra of an association scheme. I
- The subconstituent algebra of an association scheme. III
- The subconstituent algebra of an association scheme. II
- On bipartite graphs with exactly one irreducible \(T\)-module with endpoint 1, which is thin
- Notes on the Leonard system classification
- Algebraic combinatorics. Translated from the Japanese
- Hypergeometric Orthogonal Polynomials and Their q-Analogues
- THE AUGMENTED TRIDIAGONAL ALGEBRA
- Orthogonal Polynomials, Duality and Association Schemes
- TD-pairs and the $q$-Onsager algebra
- Two linear transformations each tridiagonal with respect to an eigenbasis of the other
- The Clebsch-Gordan rule for \(U(\mathfrak{sl}_2)\), the Krawtchouk algebras and the Hamming graphs
- Distance-regular graphs with classical parameters that support a uniform structure: case \(q \leq 1\)
- A \(Q\)-polynomial structure associated with the projective geometry \(L_N (q)\)
- A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\)
- Distance-regular graphs, the subconstituent algebra, and the $Q$-polynomial property
Related Items (1)
This page was built for publication: On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph
