Hamilton cycles and eigenvalues of graphs Original Research Article

We prove some results concerning necessary conditions for a graph to be Hamiltonian in terms of eigenvalues of certain matrices associated with the graph. As an example, we show how the results give an easy algebraic proof of the nonexistence of a Hamilton cycle in two graphs, one of them being the Petersen graph.