39
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

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

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          In 1962, Erd\H{o}s proved a theorem on the existence of Hamilton cycles in graphs under minimum degree and edge number condition. Significantly strengthening in case of a balanced bipartite graph, 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.

          Related collections

          Most cited references17

          • Record: found
          • Abstract: not found
          • Article: not found

          Eigenvalues of the Laplacian of a graph∗

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Sparse pseudo-random graphs are Hamiltonian

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Spectral radius and Hamiltonicity of graphs

                Bookmark

                Author and article information

                Journal
                1601.06890

                Combinatorics
                Combinatorics

                Comments

                Comment on this article