ON THE CROSSING NUMBER OF THE JOIN OF FIVE VERTEX GRAPH WITH THE DISCRETE GRAPH Dn

Abstract

In this paper, we show the values of crossing numbers for join products of graph G on five vertices with the discrete graph Dn and the path Pn on n vertices. The proof is done with the help of software. The software generates all cyclic permutations for a given number n. For cyclic permutations, P1 – Pm will create a graph in which to calculate the distances between all vertices of the graph. These distances are used in proof of crossing numbers of presented graphs.

Keywords

• crossing number
• cyclic permutations
• drawing
• graph
• join