Distance integral generalized wheel graphs (Q2099491)

The authors consider the question of when the spectrum of the distance matrix of the join of several copies of the same complete graph (\(aK_m\)) and a cycle (\(C_n\)) consists of integers only. Since both constituent graphs are regular, their adjacency eigenvalues find their way into the distance spectrum of the join, so that only integral cycles (\(n\in\{3,4,6\}\)) may appear here. The paper contains the complete solution which consists of the infinite family \((a,m,n)=(1,m,3)\) and 13 additional possibilities for \((a,m,n)\).