On perfect matchings, edge-colourings and eigenvalues of cubic graphs

We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that is, an edge colouring with three colors) the answer is known to be negative. In the latter case, a few counter examples (found by computer) are known. Here we show that these counter examples can be extended to an infinite family by use of truncation. Thus we obtain infinitely many pairs of cospectral cubic graphs with different edge-chromatic number. For all these pairs both graphs have a perfect matching, and the mentioned question is still open. But we do find a new sufficient condition for a perfect matching in a cubic graphs in terms of its spectrum. In addition we obtain a few more results concerning spectral characterizations of cubic graphs.