The crossing number of a graph problem, is in the forefront of topological graph theory. There are only few results concerning crossing numbers of loin of some graphs on few vertices with path and cycle. In the paper, for the special graph H on six vertices, we prove that the crossing numbers of its join with n isolated vertices is cr（H＋nK1）=Z（6,n）＋2「n/2」; its join with the path Pn iscr（H＋Pn）=Z（6,n）＋2「n/2」 as well as its join with the cycle Cn is...
