Let G be a graph. A k-coloring of G is a partition π = {S1, · · · , Sk} of V (G) so that each Si are independent set and take same color. A k-coloring π = {S1, · · · , Sk} of V (G) is a neighbor-locating coloring if any two vertices u, v ∈ Si, there is a color class Sj for which, one of them has a neighbor in Sj and the other not. The minimum k with this property, is said to be neighborlocating chromatic number of G, denote by χNL(G) of G. In this talk we discuss on the neighbor-locating chromatic number of Cartesian and lexicographic product of two graphs.
