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

From MaRDI portal
Publication:2056887

DOI10.1007/978-3-030-63072-0_5zbMATH Open1486.05268arXiv2201.06801OpenAlexW3133841570MaRDI QIDQ2056887FDOQ2056887


Authors: Susobhan Bandopadhyay, Sasthi C. Ghosh, Subhasis Koley Edit this on Wikidata


Publication date: 8 December 2021

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,cdots,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 lambda'h,k(G) is the minimum n such that G admits an L(h,k)-edge labeling. Here our main focus is on finding lambda'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 7leqlambda'1,2(T3)leq8, 10leqlambda'1,2(T4)leq11, 16leqlambda'1,2(T6)leq20 and 25leqlambda'1,2(T8)leq28. Here we settle two long standing open questions i.e. lambda'1,2(T3) and lambda'1,2(T4). We show lambda'1,2(T3)=7, lambda'1,2(T4)=11. We also improve the bound for T6 and T8 and prove lambda'1,2(T6)geq18, lambda'1,2(T8)geq26.


Full work available at URL: https://arxiv.org/abs/2201.06801




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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056887)