The relations among the dominating number, independence number and covering number of hypergraphs are investigated. Main results are as follows:Dv(H)≤min{α≤(H), p(H), p(H), T(H)}; De(H)≤min{v(H), T(H), p(H)}; DT(H) ≤αT(H); S(H)≤ Dv (H) + α(H)≤n; 2≤ Dv (H) + T(H) ≤n; 2 〈 Dv (H) + v(H)≤n/2 + [n/r]; Dv (H) + p(H) 〈_n;2≤De(H) + Dv(H)≤n/2 + [n/r];α(H) + De(H)≤n;2 ≤ De(H) + v(H)≤2[n/r]; 2 De(H) + p(H)≤n-r + 2.