The crossing numbers of Cartesian products of path with some graphs

The crossing numbers of Cartesian products of path, cycle or star with all graphs of order at most four are known. For the path P, of length n, the crossing numbers of Cartesian products GOP,, for all connected graphs G on five vertices are also known. Recently all known forty results concerning crossing numbers of Cartesian products of path with graphs on six vertices are collected by Klek and Petrillova. In this paper, we determine the crossing numbers for the Cartesian products of path with some graphs Hi by introducing the "zip product" method. The method of proof has generalizability, and it provides a reference for further study of similar problems.