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

Paul Terwilliger, Michael S. Lang

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let G denote a Q-polynomial distance-regular graph with diameter D at least 4. Assume that the intersection numbers of G satisfy ai=0 for 0leqileqD1 and aDeq0. We show that G is a polygon, a folded cube, or an Odd graph.


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





Cites Work


Cited In (11)






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)