On the comparison of the distinguishing coloring and the locating
coloring of graphs
On the comparison of the distinguishing coloring and the locating
coloring of graphs
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, we investigate a comparison between chi L(G) and chi D(G). In fact, we prove that chi D(G) \leq chi L(G). …