4 citations · 7 across the 7 of their papers we have counts for
1 paper · 1 filter
Jianmin Ma, Jack Koolen
It is known that a distance-regular graph with valency k at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with d…