Our purpose is to determine the minimum integer (, respectively) for every natural , such that every digraph , -connected, (, -connected respectively) and is hamiltonian (D has a hamilton path, D is hamilton connected respectively), (). We give exact values of and for some particular values of . We show the existence of and that , hold.