THE THICKNESS OF AMALGAMATIONS AND CARTESIAN PRODUCT OF GRAPHS

被引：2
|
作者：
Yang, Yan [1 ]
Chen, Yichao [2 ]
机构：
[1] Tianjin Univ, Dept Math, Tianjin 300072, Peoples R China
[2] Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China
来源：
DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2017年 / 37卷 / 03期
关键词：
thickness; amalgamation; Cartesian product; genus; GENUS;
D O I：
10.7151/dmgt.1942
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study the thickness of Cartesian product of graphs, and by using operations on graphs, we derive the thickness of the Cartesian product K-n square P-m for most values of m and n.
引用
收藏
页码：561 / 572
页数：12
相关论文
共 50 条
  • [21] FACTORING CARTESIAN-PRODUCT GRAPHS
    IMRICH, W
    ZEROVNIK, J
    JOURNAL OF GRAPH THEORY, 1994, 18 (06) : 557 - 567
  • [22] The rainbow connectivity of cartesian product graphs
    Chen, Xing
    Li, Xueliang
    Wang, Jianfeng
    Fan, Nannan
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2019, 22 (06): : 901 - 914
  • [23] Extraconnectivity of Cartesian product graphs of paths
    Fu, Mingyan
    Yang, Weihua
    Meng, Jixiang
    ARS COMBINATORIA, 2010, 96 : 515 - 520
  • [24] Game Coloring the Cartesian Product of Graphs
    Zhu, Xuding
    JOURNAL OF GRAPH THEORY, 2008, 59 (04) : 261 - 278
  • [25] Gromov hyperbolicity in Cartesian product graphs
    Michel, Junior
    Rodriguez, Jose M.
    Sigarreta, Jose M.
    Villeta, Maria
    PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES, 2010, 120 (05): : 593 - 609
  • [26] The Menger number of the Cartesian product of graphs
    Ma, Meijie
    Xu, Jun-Ming
    Zhu, Qiang
    APPLIED MATHEMATICS LETTERS, 2011, 24 (05) : 627 - 629
  • [27] On the security number of the Cartesian product of graphs
    Jakovac, Marko
    Otachi, Yota
    DISCRETE APPLIED MATHEMATICS, 2021, 304 : 119 - 128
  • [28] Betweenness centrality in Cartesian product of graphs
    Kumar, Sunil R.
    Balakrishnan, Kannan
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (01) : 571 - 583
  • [29] The Cover Time of Cartesian Product Graphs
    Abdullah, Mohammed
    Cooper, Colin
    Radzik, Tomasz
    COMBINATORIAL ALGORITHMS, 2011, 6460 : 377 - 389
  • [30] THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS
    Chithra, M. R.
    Vijayakumar, A.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (01)
12345