On NP-hard graph properties characterized by the spectrum

Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which testing whether a graph has that property can be NP-hard (or belong to other computational complexity classes consisting of even harder problems). In addition, we discuss a possible spectral characterization of some well-known NP-hard problems. In particular, for every integer $k\ge 6$ we construct a pair of $k$-regular cospectral graphs, where one graph is Hamiltonian and the other one not.