In this paper, we introduce and generalize to hypergraphs some combinatorial invariants of graphs such as matching number and induced matching number. Then we compare them and present some upper bounds for the regularity of Stanley-Reisner ring of the independence complex of H for certain hypergraphs H in terms of the introduced generalizations of matching numbers.
