Only few results concerning crossing numbers of join of some graphs are known. In the paper, for the special graph G on six vertices, we give the crossing numbers of G∨Pn and G∨Cn, Pn and Cn are the path and cycle on n vertices, respectively.