Improved bounds on the span of L(1,2)-edge labeling of some infinite regular grids

Abstract: For two given nonnegative integers

h

and

k

, an

L (h, k)

-edge labeling of a graph

G

is the assignment of labels

0, 1, c d o t s, n

to the edges so that two edges having a common vertex are labeled with difference at least

h

and two edges not having any common vertex but having a common edge connecting them are labeled with difference at least

k

. The span

l a m b d a'_{h, k} (G)

is the minimum

n

such that

G

admits an

L (h, k)

-edge labeling. Here our main focus is on finding

l a m b d a'_{1, 2} (G)

for

L (1, 2)

-edge labeling of infinite regular hexagonal (

T_{3}

), square (

T_{4}

), triangular (

T_{6}

) and octagonal (

T_{8}

) grids. It was known that

7 l e q l a m b d a'_{1, 2} (T_{3}) l e q 8

,

10 l e q l a m b d a'_{1, 2} (T_{4}) l e q 11

,

16 l e q l a m b d a'_{1, 2} (T_{6}) l e q 20

and

25 l e q l a m b d a'_{1, 2} (T_{8}) l e q 28

. Here we settle two long standing open questions i.e.

l a m b d a'_{1, 2} (T_{3})

and

l a m b d a'_{1, 2} (T_{4})

. We show

l a m b d a'_{1, 2} (T_{3}) = 7

,

l a m b d a'_{1, 2} (T_{4}) = 11

. We also improve the bound for

T_{6}

and

T_{8}

and prove

l a m b d a'_{1, 2} (T_{6}) g e q 18

,

l a m b d a'_{1, 2} (T_{8}) g e q 26

.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids