The Locating Chromatic Number of the Join of Graphs

preprint2012arXivOpen access

Abstract

Let ff be a proper kk-coloring of a connected graph GG and Π=(V1,V2,...,Vk)Π=(V_1,V_2,...,V_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,V1),d(v,V2),...,d(v,Vk)),c_{{}_Π}(v):=(d(v,V_1),d(v,V_2),...,d(v,V_k)), where d(v,Vi)=min⁡{d(v,x)∣x∈Vi},1≤i≤kd(v,V_i)=\min\{d(v,x)|x\in V_i\}, 1\leq i\leq k. If distinct vertices have distinct color codes, then ff 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 the join of graphs. We show that when G1G_1 and G2G_2 are two connected graphs with diameter at most two, then $\Cchi_{{}_L}(G_1+G_2)=\Cchi_{{}_L}(G_1)+\Cchi_{{}_L}(G_2)$, where G1+G2G_1+G_2 is the join of G1G_1 and G2G_2. Also, we determine the locating chromatic numbers of the join of paths, cycles and complete multipartite 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.