Which wheel graphs are determined by their Laplacian spectra?

The wheel graph, denoted by Wn+1Wn+1, is the graph obtained from the circuit CnCn with nn vertices by adding a new vertex and joining it to every vertex of CnCn. In this paper, the wheel graph Wn+1Wn+1, except for W7W7, is proved to be determined by its Laplacian spectrum, and a graph cospectral with the wheel graph W7W7 is given.