The characteristic polynomial of lexicographic product of graphs

Let G and H be two simple graphs. In this paper, the characteristic polynomial of G[H], the lexicographic product of G and H, is determined. As an application, the characteristic polynomial and the spectrum of G[H] are obtained explicitly when H has exactly one or two main eigenvalues.