A characterization of Q-polynomial distance-regular graphs using the intersection numbers

DOI10.1007/S00373-018-1917-5MaRDI QIDQ1756035zbMATH OpenOpenAlexFDO

Authors Supalak Sumalroj

Publication date 11 January 2019

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(Q\)-polynomialdistance-regular graph

Mathematics Subject Classification ID

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

Abstract: We consider a primitive distance-regular graph $Gamma$ with diameter at least $3$. We use the intersection numbers of $Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and only if $Gamma$ is $Q$-polynomial.

Recommendations

• A characterization of Q-polynomial distance-regular graphs
• The \(Q\)-polynomial idempotents of a distance-regular graph
• Bipartite \(Q\)-polynomial distance-regular graphs
• \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
• Almost-bipartite distance-regular graphs with the Q-polynomial property

Cites work

• A characterization of \(P\)- and \(Q\)-polynomial association schemes
• A characterization of \(Q\)-polynomial association schemes
• A characterization of Q-polynomial distance-regular graphs
• A characterization of Leonard pairs using the parameters \(\{a_i\}^d_{i=0}\)
• A new inequality for distance-regular graphs
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• The \(Q\)-polynomial idempotents of a distance-regular graph
• The subconstituent algebra of an association scheme. I
• Tridiagonal matrices with nonnegative entries

Cited in

(6)

• Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
• A diagram associated with the subconstituent algebra of a distance-regular graph
• The \(Q\)-polynomial idempotents of a distance-regular graph
• A Q-polynomial structure associated with the projective geometry L_N (q)
• Distance-regular graphs with exactly one positive q-distance eigenvalue
• A characterization of Q-polynomial distance-regular graphs

This page was built for publication: A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers

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