BILANGAN KROMATIK LOKASI UNTUK JOIN DARI DUA GRAF

Abstract

Let f be a proper k-coloring of a connected graph G and = (V
) be
an ordered partition of V (G) into the resulting color classes. For a vertex v of G, the
color code of v with respect to is dened to be the ordered k-tuple
c

(v) = (d(v; V
1
); d(v; V
2
); :::; d(v; V
));
where d(v; V
i
) = minfd(v; x)jx 2 V
i
k
g, 1 i k: If distinct vertices have distinct color
codes, then f is called a locating coloring. The minimum number of colors needed in a
locating coloring of G is the locating chromatic number of G, and denoted by
(G). In
this paper, we study the locating chromatic number of the join of some graphs.