The Crossing Number of Cartesian Products of Complete Bipartite Graphs K 2, m with Paths P n |
| |
| Authors: | Tang Ling Lv Shengxiang Huang Yuanqiu |
| |
| Affiliation: | (1) Department of Mathematics, Normal University of Hunan, Changsha, 410081, P.R. China;(2) Institute of Mathematics, Northern Jiaotong University, Beijing, 100044, P.R. China;(3) Department of Mathematics, Normal University of Hunan, Changsha, 410081, P.R. China |
| |
| Abstract: | ![]()
Most results on the crossing number of a graph focus on the special graphs, such as Cartesian products of small graphs with paths Pn, cycles Cn or stars Sn. In this paper, we extend the results to Cartesian products of complete bipartite graphs K2,m with paths Pn for arbitrary m ≥ 2 and n ≥ 1. Supported by the NSFC (No. 10771062) and the program for New Century Excellent Talents in University. |
| |
| Keywords: | Crossing number complete bipartite graph path Cartesian products |
| 本文献已被 SpringerLink 等数据库收录！ |
|
