On Bipartite Q-Polynomial Graphs of Diameter Not Greater than 5

Let u be a vertex of a bipartite Q-polynomial distance-regular graph 􀀀 of diameter D > 3,  = 􀀀D(u), and  = 2. Then  is a distance-regular Q-polynomial graph. In the cases D = 4 and D = 5 the graph  is strongly regular Q-polynomial. The half graph 􀀀2 is strongly regular and  is a neighbourhood of a vertex in the complement of 􀀀2. Therefore, a necessary condition for Q-polynomiality of 􀀀 is the strong regularity of neighbourhoods and antineighbourhoods of vertices in . A bipartite distance-regular graph 􀀀 of diameter D ∈ {4, 5} is called almost Q-polynomial if neighbourhoods and antineighbourhoods of vertices in its half-graph are strongly regular. There are two admissible intersection arrays of Q-polynomial graphs: {10, 9, 8, 7, 6; 1, 2, 3, 4, 10} (a folded 10-cube) and {55, 54, 50, 35, 10; 1, 5, 20, 45, 55}. These graphs have strongly regular graphs  (parameters (126, 25, 8, 4) and (210, 99, 48, 45)) and neighbourhoods of vertices in  (parameters (25, 8, 4, 2) and (99, 48, 22, 24)). There are two admissible intersection arrays corresponding to graphs on 704 vertices: {26, 25, 24, 2, 1; 1, 2, 24, 25, 26} and {36, 34, 32, 4, 1; 1, 4, 32, 34, 36}. In this manuscript we study almost Q-polynomial graphs of diameter 5. We obtain that distance-regular graphs with intersection arrays {26, 25, 24, 2, 1; 1, 2, 24, 25, 26} and {36, 35, 32, 4, 1; 1, 4, 32, 35, 36} do not exist.