Almost-bipartite distance-regular graphs with the Q-polynomial property
Michael S. Lang, Paul M. Terwilliger
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.