The vertex cover polynomial of a graph G of order n has been already introduced in [3]. It is defined as the polynomial, where is the number of vertex covering sets of G of size i and is the covering number of G. We obtain some properties of vertex cover polynomial of the path and cycle. Also, we obtain a recurrence relation for and establish that the coefficients are log concave.