ON THE CROSSING NUMBERS OF JOIN K_(2,3) + P_N

摘要

The main aim of the paper is to give the crossing number of join product G* + P_n for the connected graph G* of order five isomorphic with the complete bipartite graph K_(2,3), and P_n is the path on n vertices. In the proofs, it will be extend the idea of the minimum numbers of crossings between two different subgraphs from the family of subgraphs which do not cross the edges of the graph G* onto the family of subgraphs which cross the edges of G* exactly once. Due to the mentioned algebraic topological approach, we are able to extend known results concerning crossing numbers for join products of new graphs.