A drawing of graph on a plane is a representation of the graph, with distinct points representing vertices, and curves connecting the corresponding points representing edges. The crossing number of a graph is the minimum number of intersections between curves across all drawings of the graph on a plane, and the exact crossing numbers are only known for few specific families of graphs. In this project, we consider two graphs of order 6, namely G1, the union of two vertex disjoint C3, and G2, the union of two vertex disjoint C3, with an edge between the cycles. We investigate the crossing number of the join products G1+nK1 and G2+nK1, where nK1 is the graph of n isolated vertices.