A spectral condition for Hamilton cycles in tough bipartite graphs

Lianyang Ai, Wenqian Zhang

Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its adjacency matrix. For a non-complete bipartite graph $G$ with parts $X$ and $Y$, the {\em bipa…