On Neighbor chromatic number of grid and torus graphs

A set S ⊆ V is a neighborhood set of a graph G = (V, E), if G = ∪_v∈S 〈 N[v] 〉, where 〈 N[v] 〉 is the subgraph of a graph G induced by v and all vertices adjacent to v. A neighborhood set S is said to be a neighbor coloring set if it contains at least one vertex from each color class of a graph G, where color class of a colored graph is the set of vertices having one particular color. The neighbor chromatic number χ_n (G) is the minimum cardinality of a neighbor coloring set of a graph G. In this article, some results on neighbor chromatic number of Cartesian products of two paths (grid graph) and cycles (torus graphs) are explored.