Abstract
Let be a proper -coloring of a connected graph and be an ordered partition of into the resulting color classes. For a vertex of , the color code of with respect to is defined to be the ordered -tuple where . If distinct vertices have distinct color codes, then is called a locating coloring. The minimum number of colors needed in a locating coloring of is the locating chromatic number of , denoted by $\Cchi_{{}_L}(G)$. In this paper, we study the locating chromatic number of grids, the cartesian product of paths and complete graphs, and the cartesian product of two complete graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.