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 条
  • [31] On independence numbers of the Cartesian product of graphs
    Hagauer, J
    Klavzar, S
    ARS COMBINATORIA, 1996, 43 : 149 - 157
  • [32] Gromov hyperbolicity in Cartesian product graphs
    Junior Michel
    José M. Rodríguez
    José M. Sigarreta
    María Villeta
    Proceedings - Mathematical Sciences, 2010, 120 : 593 - 609
  • [33] ON TOTAL DOMINATION IN THE CARTESIAN PRODUCT OF GRAPHS
    Bresar, Bostjan
    Hartinger, Tatiana Romina
    Kos, Tim
    Milanic, Martin
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (04) : 963 - 976
  • [34] The Monophonic Number of Cartesian Product Graphs
    Santhakumaran, A. P.
    Chandran, S. V. Ullas
    INDIANA UNIVERSITY MATHEMATICS JOURNAL, 2012, 61 (02) : 849 - 857
  • [35] Incidence coloring of Cartesian product graphs
    Shiau, Alexander Chane
    Shiau, Tzong-Huei
    Wang, Yue-Li
    INFORMATION PROCESSING LETTERS, 2015, 115 (10) : 765 - 768
  • [36] Regular embeddings of Cartesian product graphs
    Zhang, Jun-Yang
    DISCRETE MATHEMATICS, 2012, 312 (02) : 258 - 264
  • [37] The Independence Number of the Cartesian Product of Graphs
    Friedler, Louis M.
    ARS COMBINATORIA, 2011, 99 : 205 - 216
  • [38] Power domination of the cartesian product of graphs
    Koh, K. M.
    Soh, K. W.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2016, 13 (01) : 22 - 30
  • [39] On cartesian product of vertex measurable graphs
    Vijayan, A.
    Kumar, S. Sanal
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2012, 15 (2-3): : 193 - 210
  • [40] Local colourings of Cartesian product graphs
    Klavzar, Sandi
    Shao, Zehui
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2015, 92 (04) : 694 - 699
12345