The chromatic distinguishing index of certain graphs

Abstract

The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge coloring with labels that is preserved only by the identity automorphism of . In this paper we compute the distinguishing chromatic index for some specific graphs. Also we study the distinguishing chromatic index of corona product and join of two graphs.

Keywords

• distinguishing index
• edge colorings
• chromatic index