Let G be a graph and let I:=I(G) be its edge ideal. In this paper, we provide an upper bound of n from which is stationary, and compute this limit explicitly. This bound is always achieved if G has no cycles of length 4 and every its connected component is either a tree or a unicyclic graph.