Contents

-

The Crossing Numbers of Cartesian Product of Cone Graph Cm+Kl¯ with Path Pn

Zheng Wenping1,2, Lin Xiaohui3, Yang Yuansheng3, Yang Xiwu1
1Department of Computer Science, Dalian University of Technology, Dalian, 116024, P. R. China
2School of Computer and Information Technology, Shanxi University, Taiyuan, 030006, P. R. China
3 Department of Computer Science, Dalian University of Technology, Dalian, 116024, P. R. China

Abstract

Crossing numbers of graphs are in general very difficult to compute. There are several known exact results on the crossing numbers of Cartesian products of paths, cycles or stars with small graphs. In this paper we study cr(W1,m◻Pn), the crossing number of Cartesian product Wl,m◻Pn, where Wl,m is the cone graph Cm+Kl¯. Klešč showed that cr(W1,3◻Pn)=2n (Journal of Graph Theory, 6(1994),605614)), cr(W1,4◻Pn)=3n1 and cr(W2,3◻Pn)=4n (Discrete Mathematics, 233(2001),353359). Huang et al. showed that cr(W1,m◻Pn)=(n1)m2m12+n+1. for n3 (Journal of Natural Science of Hunan Normal University,28(2005),1416). We extend these results and prove cr(W1,m◻Pn)=(n1)m2m12+n+1 and cr(W2,m◻Pn)=2nm2m12+2n.