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
Publication date: 8 December 2021
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 , .
Full work available at URL: https://arxiv.org/abs/2201.06801
Recommendations
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
Cited In (7)
- Induced \(nK_2\) decomposition of infinite square grids and infinite hexagonal grids
- Optimal \(L(j,k)\)-edge-labeling of regular grids
- \(L(h, k)\)-labelling for octagonal grid
- On \(L'(2, 1)\)-edge coloring number of regular grids
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
- \(\lambda\)-edge span of some almost regular graphs
- Optimal \(L(h,k)\)-labeling of regular grids
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)