English

Improved Bounds on the Span of $L(1,2)$-edge Labeling of Some Infinite Regular Grids

Discrete Mathematics 2022-01-19 v1 Combinatorics

Abstract

For two given nonnegative integers hh and kk, an L(h,k)L(h,k)-edge labeling of a graph GG is the assignment of labels {0,1,,n}\{0,1, \cdots, n\} to the edges so that two edges having a common vertex are labeled with difference at least hh and two edges not having any common vertex but having a common edge connecting them are labeled with difference at least kk. The span λh,k(G)\lambda'_{h,k}{(G)} is the minimum nn such that GG admits an L(h,k)L(h,k)-edge labeling. Here our main focus is on finding λ1,2(G)\lambda'_{1,2}{(G)} for L(1,2)L(1,2)-edge labeling of infinite regular hexagonal (T3T_3), square (T4T_4), triangular (T6T_6) and octagonal (T8T_8) grids. It was known that 7λ1,2(T3)87 \leq \lambda'_{1,2}{(T_3)} \leq 8, 10λ1,2(T4)1110 \leq \lambda'_{1,2}{(T_4)} \leq 11, 16λ1,2(T6)2016 \leq \lambda'_{1,2}{(T_6)} \leq 20 and 25λ1,2(T8)2825 \leq \lambda'_{1,2}{(T_8)} \leq 28. Here we settle two long standing open questions i.e. λ1,2(T3)\lambda'_{1,2}{(T_3)} and λ1,2(T4)\lambda'_{1,2}{(T_4)}. We show λ1,2(T3)=7\lambda'_{1,2}{(T_3)} =7, λ1,2(T4)=11\lambda'_{1,2}{(T_4)}= 11. We also improve the bound for T6T_6 and T8T_8 and prove λ1,2(T6)18\lambda'_{1,2}{(T_6)} \geq 18, λ1,2(T8)26 \lambda'_{1,2}{(T_8)} \geq 26.

Keywords

Cite

@article{arxiv.2201.06801,
  title  = {Improved Bounds on the Span of $L(1,2)$-edge Labeling of Some Infinite Regular Grids},
  author = {Susobhan Bandopadhyay and Sasthi C. Ghosh and Subhasis Koley},
  journal= {arXiv preprint arXiv:2201.06801},
  year   = {2022}
}