Distant sum distinguishing index of graphs

Abstract: Consider a positive integer

r

and a graph

G = (V, E)

with maximum degree

D e l t a

and without isolated edges. The least

k

so that a proper edge colouring

c : E o 1, 2, l d o t s, k

exists such that

s u m_{e i u} c (e) e q s u m_{e i v} c (e)

for every pair of distinct vertices

u, v

at distance at most

r

in

G

is denoted by

c h i'_{S i g m a, r} (G)

. For

r = 1

it has been proved that

c h i'_{S i g m a, 1} (G) = (1 + o (1)) D e l t a

. For any

r g e q 2

in turn an infinite family of graphs is known with

c h i'_{S i g m a, r} (G) = O m e g a (D e l t a^{r - 1})

. We prove that on the other hand,

c h i'_{S i g m a, r} (G) = O (D e l t a^{r - 1})

for

r g e q 2

. In particular we show that

c h i'_{S i g m a, r} (G) l e q 6 D e l t a^{r - 1}

if

r g e q 4

.

Cites Work

Cited In (3)

This page was built for publication: Distant sum distinguishing index of graphs