The Matching Number and Hamiltonicity of Graphs

Abstract

The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.