Distinguishing colorings of Cartesian products of complete graphs

被引：29
|
作者：
Fisher, Michael J. [1 ]
Isaak, Garth [2 ]
机构：
[1] Calif State Univ Fresno, Dept Math, Fresno, CA 93740 USA
[2] Lehigh Univ, Dept Math, Bethlehem, PA 18015 USA
来源：
DISCRETE MATHEMATICS | 2008年 / 308卷 / 11期
关键词：
edge coloring; automorphism; distinguishing number;
D O I：
10.1016/j.disc.2007.04.070
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph K-s,K-t which admits only the identity automorphism. In particular, this allows us to determine the distinguishing number of the Cartesian product of complete graphs. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：2240 / 2246
页数：7
相关论文
共 50 条
  • [1] The distinguishing number of Cartesian products of complete graphs
    Imrich, Wilfried
    Jerebic, Janja
    Klavzar, Sandi
    EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (04) : 922 - 929
  • [2] Equitable colorings of Cartesian products with balanced complete multipartite graphs
    Yan, Zhidan
    Wang, Wei
    Zhang, Xin
    DISCRETE APPLIED MATHEMATICS, 2015, 180 : 200 - 203
  • [3] Distinguishing numbers of Cartesian products of multiple complete graphs
    Fisher, Michael J.
    Isaak, Garth
    ARS MATHEMATICA CONTEMPORANEA, 2012, 5 (01) : 159 - 173
  • [4] Equitable colorings of Cartesian products of graphs
    Lin, Wu-Hsiung
    Chang, Gerard J.
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (03) : 239 - 247
  • [5] Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
    Cavers, M. S.
    Seyffarth, K.
    White, E. P.
    DISCRETE MATHEMATICS, 2018, 341 (09) : 2431 - 2441
  • [6] The distinguishing chromatic number of Cartesian products of two complete graphs
    Jerebic, Janja
    Klavzar, Sandi
    DISCRETE MATHEMATICS, 2010, 310 (12) : 1715 - 1720
  • [7] Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
    Shasha Ma
    Liancui Zuo
    Journal of Combinatorial Optimization, 2016, 32 : 725 - 740
  • [8] Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
    Ma, Shasha
    Zuo, Liancui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (03) : 725 - 740
  • [9] DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS
    Estaji, Ehsan
    Imrich, Wilfried
    Kalinowski, Rafal
    Pilsniak, Monika
    Tucker, Thomas
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (01) : 155 - 164
  • [10] Equitable colorings of cartesian products of fans with bipartite graphs
    College of Mathematical Science, Tianjin Normal University, Tianjin
    300387, China
    不详
    300387, China
    Ital. J. Pure Appl. Math., 35 (91-100):
12345