15 citations · 29 across the 3 of their papers we have counts for
1 paper · 2 filters
Sebastian M. Cioabă, Jack H. Koolen, Weiqiang Li
Let G be a distance-regular graph of order v and size e. In this paper, we show that the max-cut in G is at most e(1−1/g), where g is the odd girth of G. This result…