On the spectra of wreath products of circulant graphs.

In this paper, we consider the wreath product of two graphs that yields much more larger graphs than other graph products. We drive a formula for the adjacency spectrum of the wreath product of a complete graph and a circulant graph. As its applications, we obtain their (normalized) Laplacian spectra and further compute the adjacency spectra when the circulant graphs are respectively the Möbius ladder graph, the crown graph and the Andrásfai graph. Moreover, some known results are generalized and a problem is posed for further study. [ABSTRACT FROM AUTHOR]