Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs

Abstract

In 1962, Erdős proved a theorem on the existence of Hamilton cycles in graphs with given minimum degree and number of edges. Significantly strengthening in case of balanced bipartite graphs, Moon and Moser proved a corresponding theorem in 1963. In this paper we establish several spectral analogues of Moon and Moser's theorem on Hamilton paths in balanced bipartite graphs and nearly balanced bipartite graphs. One main ingredient of our proofs is a structural result of its own interest, involving Hamilton paths in balanced bipartite graphs with given minimum degree and number of edges.

14 pages, 2 figures, Version 2 differs from Version 1 in improved presentation, to appear in Linear Algebra and Its Applications