On the Locating Chromatic Number of the Cartesian Product of Graphs

preprint2012arXivOpen access

Abstract

Let cc be a proper kk-coloring of a connected graph GG and Π=(C1,C2,...,Ck)Π=(C_1,C_2,...,C_k) be an ordered partition of V(G)V(G) into the resulting color classes. For a vertex vv of GG, the color code of vv with respect to ΠΠ is defined to be the ordered kk-tuple cΠ(v):=(d(v,C1),d(v,C2),...,d(v,Ck)),c_{{}_Π}(v):=(d(v,C_1),d(v,C_2),...,d(v,C_k)), where d(v,Ci)=min⁡{d(v,x)∣x∈Ci},1≤i≤kd(v,C_i)=\min\{d(v,x) | x\in C_i\}, 1\leq i\leq k. If distinct vertices have distinct color codes, then cc is called a locating coloring. The minimum number of colors needed in a locating coloring of GG is the locating chromatic number of GG, 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.