期刊名称：International Journal of Advances in Soft Computing and Its Applications
印刷版ISSN：2074-8523
出版年度：2016
卷号：8
期号：2
出版社：International Center for Scientific Research and Studies
摘要：The crossing number of a graph G is the minimum number of crossings of its edges among the drawings of G in the plane and is denoted by cr(G). Zarankiewicz conjectured that the crossing number of the complete bipartite graph Km,n equals. This conjecture has been verified by Kleitman for min {m, n} ≤ 6. Using this result, we give the exact values of crossing number of the join of a certain graph G on six vertices with a path and a cycle on n vertices
关键词：Crossing Number; Good drawing of a graph; Union and join of graphs
