On the crossing numbers of products of stars and graphs of order five (Q5943048)

Although there are a number of exact results on the crossing number of some particular kinds of graphs including Cartesian products of paths or circuits with some specific smaller graphs, the problem of determining the exact crossing number of a graph is extremely hard in general. This paper provides the exact crossing number of the Cartesian product of two specific graphs: one is a graph of order 5 and the other is a path of order \(n+1\).