Farrell in [1] and Godsil and Gutman in [2] gave different definitions about matching polynomials In this paper we use the definition of [1] If G is a graph

m(G

i) will denote the number of matchings in G

i.e.

the number of selections of i independent edges of G.If i=0

We define m(G

0)=1.If G has n vertices

we call the polyrnomial to be the matching polynomial of G.By ■ we denote the complement of G obtained by deleting the edges of G from the complete graph Km

Let Gm

n denote the bipartite graph with bipartition m and n By ■ we denote the bi-complement of Gm

n obtained by deleting the edges of Gm

n from Km

n (where Km

n is the complete bipartite graph with bipartition m and n).