Vertex subsets with minimal width and dual width in \(Q\)-polynomial distance-regular graphs
From MaRDI portal
Publication:640422
zbMath1235.05160arXiv1011.2000MaRDI QIDQ640422
Publication date: 18 October 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.2000
Partial orders, general (06A06) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Semilattices (06A12)
Related Items
Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ Grassmann graphs, degenerate DAHA, and non-symmetric dual \(q\)-Hahn polynomials ⋮ On \(q\)-analogues and stability theorems ⋮ Optimal and extremal graphical designs on regular graphs associated with classical parameters ⋮ \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one ⋮ The Terwilliger algebra of the twisted Grassmann graph: the thin case ⋮ The Erdős-Ko-Rado theorem for twisted Grassmann graphs ⋮ Dual polar graphs, a nil-DAHA of rank one, and non-symmetric dual \(q\)-Krawtchouk polynomials ⋮ A bilinear form relating two Leonard systems ⋮ On the Cheeger constant for distance-regular graphs ⋮ Scaling limits for the Gibbs states on distance-regular graphs with classical parameters
