The locating chromatic number of the join of graphs

Abstract: Let

f

be a proper

k

-coloring of a connected graph

G

and

P i = (V_{1}, V_{2}, ..., V_{k})

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

P i

is defined to be the ordered

k

-tuple

c_{_{P} i} (v) := (d (v, V_{1}), d (v, V_{2}), ..., d (v, V_{k})),

where

d (v, V_{i}) = m i n d (v, x) | x i n V_{i}, 1 l e q i l e q 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

, denoted by

C c h i_{_{L}} (G)

. In this paper, we study the locating chromatic number of the join of graphs. We show that when

G_{1}

and

G_{2}

are two connected graphs with diameter at most two, then

C c h i_{_{L}} (G_{1} + G_{2}) = C c h i_{_{L}} (G_{1}) + C c h i_{_{L}} (G_{2})

, where

G_{1} + G_{2}

is the join of

G_{1}

and

G_{2}

. Also, we determine the locating chromatic numbers of the join of paths, cycles and complete multipartite graphs.

Recommendations

Cited in

(19)

This page was built for publication: The locating chromatic number of the join of graphs