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 and , an -edge labeling of a graph is the assignment of labels to the edges so that two edges having a common vertex are labeled with difference at least and two edges not having any common vertex but having a common edge connecting them are labeled with difference at least . The span is the minimum such that admits an -edge labeling. Here our main focus is on finding for -edge labeling of infinite regular hexagonal (), square (), triangular () and octagonal () grids. It was known that , , and . Here we settle two long standing open questions i.e. and . We show , . We also improve the bound for and and prove , .
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}
}