Almost-bipartite distance-regular graphs with the Q-polynomial property
From MaRDI portal
Publication:854828
DOI10.1016/J.EJC.2005.07.004zbMATH Open1124.05095arXivmath/0508435OpenAlexW1970124289MaRDI QIDQ854828FDOQ854828
Authors: Michael S. Lang, Paul Terwilliger
Publication date: 7 December 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: Let denote a -polynomial distance-regular graph with diameter at least 4. Assume that the intersection numbers of satisfy for and . We show that is a polygon, a folded cube, or an Odd graph.
Full work available at URL: https://arxiv.org/abs/math/0508435
Recommendations
- Dual bipartite Q-polynomial distance-regular graphs
- Bipartite \(Q\)-polynomial distance-regular graphs
- Bipartite \(Q\)-polynomial quotients of antipodal distance-regular graphs
- On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\)
- On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The subconstituent algebra of an association scheme. I
- The subconstituent algebra of an association scheme. III
- The subconstituent algebra of an association scheme. II
- Title not available (Why is that?)
- A new inequality for bipartite distance-regular graphs.
- 2-homogeneous bipartite distance-regular graphs
- Homogeneous graphs and regular near polygons
- The Terwilliger algebra of an almost-bipartite \(P\)- and \(Q\)-polynomial association scheme
- Spin models on bipartite distance-regular graphs
Cited In (17)
- Dual bipartite Q-polynomial distance-regular graphs
- \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one
- On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
- Twice \(Q\)-polynomial distance-regular graphs of diameter 4
- A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers
- A \(Q\)-polynomial structure associated with the projective geometry \(L_N (q)\)
- The Norton algebra of a \(Q\)-polynomial distance-regular graph
- The distance-4-graphs satisfying \(\Delta_2 (\alpha)=\Gamma_j (\alpha)\)
- On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph
- Title not available (Why is that?)
- A class of distance-regular graphs that are \(\phi\)-polynomial
- Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets
- A duality between pairs of split decompositions for a Q-polynomial distance-regular graph
- A diagram associated with the subconstituent algebra of a distance-regular graph
- On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)
This page was built for publication: Almost-bipartite distance-regular graphs with the \(Q\)-polynomial property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854828)