• VERTEX COVER POLYNOMIAL OF Kn × Kr

Abstract

The vertex cover Polynomial of a graph G of order n has been already introduced in [3]. It is defined as the polynomial, C (G, i) =, where c (G, i) is the number of vertex covering sets of G of size i and b(G) is the  covering number of G.  In this paper, we derived a formula for finding the vertex cover polynomial of  K_n ´ K_r. Aslo we proved that x^{r - r n}  [C(K_n ´ K_r, x] is log concave.