点击次数：

论文类型：期刊论文

发表时间：2008-12-28

发表刊物：DISCRETE MATHEMATICS

收录刊物：SCIE

卷号：308

期号：24

页面范围：6639-6644

ISSN号：0012-365X

关键字：Crossing number; Cartesian product; Bipartite graph Path

摘要：Investigation of the crossing number of graphs is a classical but very difficult problem. The exact value of the crossing number is known only for a few specific families of graphs. In this paper we extend a recent result from Bokal on the crossing number of K(1,m)square P(n), and prove that cr(K(2,m)square P(n)) = 2n left perpendicular m/2 right perpendicular left perpendicular m-1/2 right perpendicular. (C) 2007 Elsevier B.V. All rights reserved.