Let $G=(V,E)$ be a simple graph. A subset $S$ of $V$ is called an equitable vertex covering of $G$ if for every equitable edge $e=uv$, either $u\in S$ or $v\in S$. The minimum cardinality of an equitable vertex cover of $G$ ia called the euitable covering number of $G$ and is denoted by $\alpha^e_o(G)$. In this paper results involving in this new parameter are found. Also we introduced the Equitable Packing and Equitable Full sets.