On the crossing number of products of a graph of order 6 and the star
Huang Yuan-qiu · Journal of Hunan University of Arts and Science · 2008
The crossing number of Cartesian products of the graph order 6 and star,presently,was proved only for that of several graphs order 6 which are few edges and star.We add two vertices to an edge of K4 to obtain a graph F which is order 6.By connecting the 6 vertices of graph F to other n vertices will obtain a special family of graph denoted by Hn.In this paper,we proved that the crossing number of Hn is Z(6,n)+n and thereout we attested the crossing number of F×Sn is Z(6, n)+2n.