On the comparison of the distinguishing coloring and the locating coloring of graphs

M. Korivand, A. Erfanian, Edy T. Baskoro

Let G be a simple connected graph. Then chi L(G) and chi D(G) will denote the locating chromatic number and the distinguishing chromatic number of G, respectively. In this paper, w…