THE LOCATING-CHROMATIC NUMBER FOR CORONA PRODUCT OF GRAPHS

Abstract

The locating-chromatic number of a graph G can be defined as the cardinality of a minimum ordered partition Π of the vertex set V (G) such that every vertex in G has the different coordinates with respect to Π and every two adjacent vertices in G are not included in the same partition class. In this case, the coordinate of a vertex v is defined as the distances from vertex v to the ordered partition classes in Π. In this paper, we discuss the locating-chromatic number for a corona product of two graphs.