The crossing number of the Cartesian product of paths with complete graphs

被引：13
|
作者：
Ouyang, ZhangDong [1 ]
Wang, Jing [2 ]
Huang, YuanQiu [3 ]
机构：
[1] Hunan First Normal Univ, Dept Math, Changsha 410205, Hunan, Peoples R China
[2] Changsha Univ, Dept Math & Informat Sci, Changsha 410003, Hunan, Peoples R China
[3] Hunan Normal Univ, Dept Math, Changsha 410081, Hunan, Peoples R China
来源：
DISCRETE MATHEMATICS | 2014年 / 328卷
基金：
中国国家自然科学基金;
关键词：
Crossing number; Cartesian product; Zip product; Complete graph; X C-N;
D O I：
10.1016/j.disc.2014.03.011
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we determine the crossing number of Kin \ e by the construction method for m <= 12 and apply the zip product to obtain that cr(K-m rectangle P-n) = (n - 1)cr(Km+2 \ e) 2cr(Km+1) for n >= 1. Furthermore, we have [GRAPHICS] for n >= 1, 1 <= m <= 10, which is consistent with Zheng's conjecture for the crossing number of K-m rectangle P-n (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：71 / 78
页数：8
相关论文
共 50 条
  • [1] The crossing number of Cartesian products of complete bipartite graphs K2,m with paths Pn
    Ling, Tang
    Shengxiang, Lv
    Yuanqiu, Huang
    [J]. GRAPHS AND COMBINATORICS, 2007, 23 (06) : 659 - 666
  • [2] The Crossing Number of Cartesian Products of Complete Bipartite Graphs K2,m with Paths Pn
    Tang Ling
    Lv Shengxiang
    Huang Yuanqiu
    [J]. Graphs and Combinatorics, 2007, 23 : 659 - 666
  • [3] Channel assignment on Cartesian product of paths with complete bipartite graphs
    Lai, Yung-Ling
    Wu, Hsin-Ju
    [J]. 3RD INT CONF ON CYBERNETICS AND INFORMATION TECHNOLOGIES, SYSTEMS, AND APPLICAT/4TH INT CONF ON COMPUTING, COMMUNICATIONS AND CONTROL TECHNOLOGIES, VOL 3, 2006, : 180 - +
  • [4] Embedding complete multipartite graphs into Cartesian product of paths and cycles
    Rajan, R. Sundara
    Shantrinal, A. Arul
    Rajalaxmi, T. M.
    Fan, Jianxi
    Fan, Weibei
    [J]. ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2021, 9 (02) : 507 - 525
  • [5] Decomposition of Cartesian product of complete graphs into paths and stars with four edges
    Ezhilarasi, Arockiajeyaraj P.
    Muthusamy, Appu
    [J]. COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE, 2021, 62 (03): : 273 - 289
  • [6] Extraconnectivity of Cartesian product graphs of paths
    Fu, Mingyan
    Yang, Weihua
    Meng, Jixiang
    [J]. ARS COMBINATORIA, 2010, 96 : 515 - 520
  • [7] Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
    Baby, J. Maria Regila
    Samundesvari, K. Uma
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2022, 14 (01)
  • [8] The crossing number of Cartesian product of sunlet graph with path and complete bipartite graph
    Alhajjar, Mhaid
    Panda, Amaresh Chandra
    Behera, Siva Prasad
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (01)
  • [9] On the crossing numbers of Cartesian products of paths with special graphs
    Klesc, Marian
    Kravecova, Daniela
    Petrillova, Jana
    [J]. CARPATHIAN JOURNAL OF MATHEMATICS, 2014, 30 (03) : 317 - 325
  • [10] On the Crossing Number of Complete Graphs
    O. Aichholzer
    F. Aurenhammer
    H. Krasser
    [J]. Computing, 2006, 76 : 165 - 176
12345