Hits:

Indexed by:期刊论文

Date of Publication:2008-12-28

Journal:DISCRETE MATHEMATICS

Included Journals:SCIE

Volume:308

Issue:24

Page Number:6639-6644

ISSN No.:0012-365X

Key Words:Crossing number; Cartesian product; Bipartite graph Path

Abstract: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.