on determining the distance spectrum of a class of distance 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. let n and k be integers with n > 2k, k ≥ 1. the bipartite kneser graph h(n, k) is the graph with the set of all k and n − k subsets of the set [n] = {1, 2, ..., n} as vertices, in which two vertices are adjacent if and only if one of them is a subset of the other. in this paper, we determine the distance spectrum of h(n, 1). although the obtained result is not new [12], but our proof is new. the main tool that we use in our work is the orbit partition method in algebraic graph theory for finding the eigenvalues of graphs. we introduce a new method for determining the distance spectrum of h(n, 1) and show how a quotient matrix can contain all distance eigenvalues of a graph.