Almost-bipartite distance-regular graphs with the Q-polynomial property
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 0 ≤ i ≤ D-1 and aD≠ 0. We show that G is a polygon, a folded cube, or an Odd graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.