The crossing number cr($G$) of a graph $G$ is the minimal number of crossing over all drawings of $G$ in the plane. According to their special structure, the class of Join products of two graphs is one of few graph classes for which some exact values crossing numbers were obtained. Using a new Disk drawing method in this paper we are dealing with the join products of path with graph $Q$ on six vertices, and give the exact values of crossing numbers for the join produ...
