The chromatic distinguishing index of certain graphs

2017/12/11 by Alikhani, Saeid, Soltani, Samaneh
#05C15 #05C25 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1712.03649

Abstract

The distinguishing index of a graph G, denoted by D'(G), is the least number of labels in an edge labeling of G not preserved by any non-trivial automorphism. The distinguishing chromatic index χ'_D (G) of a graph G is the least number d such that G has a proper edge labeling with d labels that is preserved only by the identity automorphism of G. 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.

Related

• Distinguishing number and distinguishing index of certain graphs
• The distinguishing number and the distinguishing index of Cayley graphs
• Distinguishing number and distinguishing index of neighbourhood corona of two graphs
• Distinguishing number and distinguishing index of join of two graphs
• An upper bound on the distinguishing index of graphs with minimum degree at least two