On the crossing numbers of join products of five graphs of order six with the discrete graph

Abstract

The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product $G^{\ast}+D_{n}$, where the disconnected graph $G^{\ast}$ of order six consists of one isolated vertex and of one edge joining two nonadjacent vertices of the $5$-cycle. In our proof, the idea of cyclic permutations and their combinatorial properties will be used. Finally, by adding new edges to the graph $G^{\ast}$, the crossing numbers of $G_{i}+D_{n}$ for four other graphs $G_{i}$ of order six will be also established.