Minimum crossings in join of graphs with paths and cycles
Marián Klešč, Matúš Valo · Acta Electrotechnica et Informatica · 2012
The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane.Only few results concerning crossing numbers of graphs obtained as join product of two graphs are known.There was collected the exact values of crossing numbers for join of all graphs of at most four vertices and of several graphs of order five with paths and cycles.We extend these results by giving the crossing numbers for join products of the special graph on six vertices with n isolated vertices as well as with the path on n vertices and with the cycle on n vertices.