On the locating-chromatic number of corona product of graphs

Dian Kastika Syofyan, Suhadi Wido Saputro, Edy Tri Baskoro +1

Let $G=(V,E)$ be a finite, simple, and connected graph. The locating-chromatic number of a graph $G$ can be defined as the cardinality of a minimum resolving partition of the verte…