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, ·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 λ'h,k(G) is the minimum n such that G admits an L(h,k)-edge labeling. Here our main focus is on finding λ'1,2(G) for L(1,2)-edge labeling of infinite regular hexagonal (T3), square (T4), triangular (T6) and octagonal (T8) grids. It was known that 7 ≤ λ'1,2(T3) ≤ 8, 10 ≤ λ'1,2(T4) ≤ 11, 16 ≤ λ'1,2(T6) ≤ 20 and 25 ≤ λ'1,2(T8) ≤ 28. Here we settle two long standing open questions i.e. λ'1,2(T3) and λ'1,2(T4). We show λ'1,2(T3) =7, λ'1,2(T4)= 11. We also improve the bound for T6 and T8 and prove λ'1,2(T6) ≥ 18, λ'1,2(T8) ≥ 26.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…