some new classes of distance integral graphs constructed from integral graphs

The distance eigenvalues of a connected graph g are the eigenvalues of its distance matrix d(g). a graph is called distance integral if all of its distance eigenvalues are integers. in this paper, we introduce some new classes of distance integral graphs. in particular, we show that if n, k are integers such that n ⩾ 3k > 0, then the bipartite kneser graph h(n, k) is distance integral. moreover, we determine the distance spectrum of h(n, k). also, we show that every distance regular integral graph is distance integral.