|
چکیده
|
Let G be a simple fnite graph. A k-coloring of G is a partition π = {S1, · · · , Sk} of V (G) so that each Si is an independent set and any vertex in Si takes color i. 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 neighbor locating chromatic number of G, denoted by χNL(G) of G. We initiate to study the neighbor locating coloring of graphs resulted from three types of product of two graphs. We investigate the neighbor locating chromatic number of Cartesian, lexicographic and corona product of two graphs. Finally, we untangle the neighbor locating chromatic number of any aforementioned three products of cycles, paths and complete graphs.
|