Crossing numbers of cartesian products of stars with 5-vertex graphs
Huang Yuan-qiu · Ha'erbin gongye daxue xuebao · 2009
Garey and Johxon have proved that the problem to determine the crossing number of graphs is NP-complete.Because of its difficulty,we only know the crossing number of some classes of special graphs.The crossing number of Cartesian products of paths and cycles with 5-vertex graphs are mostly known,but only few cartesian products of 5-vertex graphs with star K1,n are known.In this paper,we extend these results,and determine the crossing numbers of Cartesian products of two 5-vertex graphs with star K1,n.