On radio k-chromatic number of powers of paths having small diameter

Abstract: The radio

k

-coloring is an assignment

l

of non-negative integers to the vertices of a graph in such a way that for two vertices

u, v

which are

d

distance apart, we must have

| l (u) - l (v) | g e q k + 1 - d

. The difference between the greatest and the least image of

l

is its span and our objective is to minimize the span. That is, the radio

k

-chromatic number

r c_{k} (G)

is the minimum

l a m b d a

such that it is a span of some radio

k

-coloring of

G

. In this article, we find exact values of

r c_{k} (P_{n}^{m})

when

k > d i a m (P_{n}^{m}) + e p s i l o n

, where

P_{n}^{m}

denotes the

m^{t h}

power of a path on

(n + 1)

vertices, and

d i a m (P_{n}^{m})

denotes its diameter.

This page was built for publication: On radio $k$-chromatic number of powers of paths having small diameter