Hits:

Indexed by:期刊论文

Date of Publication:2008-12-28

Journal:Discrete Mathematics

Included Journals:EI、Scopus

Volume:308

Issue:24

Page Number:6639-6644

ISSN No.:0012365X

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 K1, m Pn, and prove that c r (K2, m Pn) = 2 n  ?frac(m, 2)  ? ?frac(m - 1, 2)  ? © 2007 Elsevier B.V. All rights reserved.