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

共 8 条

[1]

Albee G W, 1996, J Prim Prev, V17, P3, DOI 10.1007/BF02262735

[2]

ALBERTSON MO, 2005, ELECTRON J COMB, V12, P5

[3]

FISHER MJ, 2004, UNPUB EDGE COLORED C

[4] Identity orientation of complete bipartite graphs [J].

Harary, F ;

Ranjan, D .

DISCRETE MATHEMATICS, 2005, 290 (2-3) :173-182

[5]

Harary F., 2001, DISCUSS MATH GRAPH T, V21, P149

[6]

IMRICH W, 2006, UNPUB EUROPEAN J COM

[7] Distinguishing Cartesian powers of graphs [J].

Imrich, Wilfried ;

Klavzar, Sandi .

JOURNAL OF GRAPH THEORY, 2006, 53 (03) :250-260

[8] Cartesian powers of graphs can be distinguished by two labels [J].

Klavzar, Sandi ;

Zhu, Xuding .

EUROPEAN JOURNAL OF COMBINATORICS, 2007, 28 (01) :303-310

← 1 →