Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs

MaRDI QIDQ640422zbMATH OpenFDO

Authors Hajime Tanaka

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, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p167.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

descendentsshort regular semilattices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Partial orders, general (06A06) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Structural characterization of families of graphs (05C75) Semilattices (06A12)

Abstract: We study $Q$-polynomial distance-regular graphs from the point of view of what we call descendents, that is to say, those vertex subsets with the property that the width $w$ and dual width $w^{\ast }$ satisfy $w+w^{\ast }=d$, where $d$ is the diameter of the graph. We show among other results that a nontrivial descendent with $wge2$ is convex precisely when the graph has classical parameters. The classification of descendents has been done for the 5 classical families of graphs associated with short regular semilattices. We revisit and characterize these families in terms of posets consisting of descendents, and extend the classification to all of the 15 known infinite families with classical parameters and with unbounded diameter.

Recommendations

• Width and dual width of subsets in polynomial association schemes
• Dual bipartite Q-polynomial distance-regular graphs
• The \(Q\)-polynomial idempotents of a distance-regular graph
• The last subconstituent of a bipartite Q-polynomial distance-regular graph
• A characterization of Q-polynomial distance-regular graphs

Cited in

(14)

• A bilinear form relating two Leonard systems
• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• Optimal and extremal graphical designs on regular graphs associated with classical parameters
• PBIB-designs from certain subsets of distance-regular graphs
• Width and dual width of subsets in polynomial association schemes
• Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets
• On the Cheeger constant for distance-regular graphs
• On \(q\)-analogues and stability theorems
• \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• Grassmann graphs, degenerate DAHA, and non-symmetric dual \(q\)-Hahn polynomials
• Scaling limits for the Gibbs states on distance-regular graphs with classical parameters
• Dual polar graphs, a nil-DAHA of rank one, and non-symmetric dual \(q\)-Krawtchouk polynomials
• The Terwilliger algebra of the twisted Grassmann graph: the thin case

This page was built for publication: Vertex subsets with minimal width and dual width in \(Q\)-polynomial distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640422)