A spectral condition for Hamilton cycles in tough bipartite graphs

Let G be a graph. The 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 bipartite toughness of G is defined as t B ( G ) = min | S | c ( G - S ) , where the minimum is taken over all proper subsets S ⊂ X (or S ⊂ Y )...

Full description