The Terwilliger polynomial of a Q-polynomial distance-regular graph and its application to pseudo-partition graphs

DOI10.1016/J.LAA.2014.09.048MaRDI QIDQ472425zbMATH OpenOpenAlexFDO

Authors Alexander L. Gavrilyuk, Jack H. Koolen

Publication date 19 November 2014

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.4027

zbMATH Keywords

distance-regular graphTerwilliger algebra\(Q\)-polynomialfolded halved cubefolded Johnson graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Abstract: Let $Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(lambda)inmathbbC[lambda]$, of degree $4$ depending only on the intersection numbers of $Gamma$ and such that $T(eta)geq0$ holds for any non-principal eigenvalue $eta$ of the local graph $Gamma(x)$ for any vertex $xinV(Gamma)$. We call $T(lambda)$ the Terwilliger polynomial of $Gamma$. In this paper, we give an explicit formula for $T(lambda)$ in terms of the intersection numbers of $Gamma$ and its dual eigenvalues. We then apply this polynomial to show that all pseudo-partition graphs with diameter at least $3$ are known.

Recommendations

• \(Q\)-polynomial distance-regular graphs with \(a_1=0\) and \(a_2\neq 0\)
• Bipartite distance-regular graphs: the Q-polynomial property and pseudo primitive idempotents
• A characterization of Q-polynomial distance-regular graphs
• Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra.
• Tight distance-regular graphs and the \(Q\)-polynomial property

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A class of distance-regular graphs that are \(\phi\)-polynomial
• Characerization of a class of distance regular graphs.
• Characterization of the folded Johnson graphs of small diameter by their intersection arrays
• Distance-regular graphs with girth 3 or 4: I
• Exceptional graphs with smallest eigenvalue -2 and related problems
• Extremal 1-codes in distance-regular graphs of diameter 3
• Kite-free distance-regular graphs
• Locally 4‐by‐4 grid graphs
• Locally Shrikhande graphs and their automorphisms
• On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays
• On the characterization of the folded halved cubes by their intersection arrays
• Some algebra related to \(P\)- and \(Q\)-polynomial association schemes
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• The spectra of the local graphs of the twisted Grassmann graphs
• The structure of nonthin irreducible \(T\)-modules of endpoint 1: Ladder bases and classical parameters
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. II
• Tight distance-regular graphs and the subconstituent algebra
• Triple intersection numbers of Q-polynomial distance-regular graphs
• Twice Q-polynomial distance-regular graphs
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs

Cited in

(8)

• Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
• On tight 4-designs in Hamming association schemes
• On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
• On nonexistence of distance regular graphs with the intersection array ${53,40,28,16;1,4,10,28}$
• A characterization of the Grassmann graphs
• On few-class \(Q\)-polynomial association schemes: feasible parameters and nonexistence results
• A diagram associated with the subconstituent algebra of a distance-regular graph
• Remarks on pseudo-vertex-transitive graphs with small diameter

This page was built for publication: The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs

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