| Title: | L (D, 2, 1)-labeling of Square Grid |
|---|
| Authors: | ID Atta, Soumen, Department of Computer Science and Engineering, University of Kalyani, Kalyani, Nadia, West Bengal 741235, India (Author)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering, University of Kalyani, Kalyani, Nadia, West Bengal 741235, India (Author) |
|---|
| Files: |
This document has no files that are freely available to the public. This document may have a physical copy in the library of the organization, check the status via COBISS.  |
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | UNG - University of Nova Gorica
|
|---|
| Abstract: | For a fixed integer $D (\geq 3)$ and $\lambda$ $\in$ $\mathbb{Z}^+$, a $\lambda$-$L(D, 2, 1)$-$labeling$ of a graph $G = (V, E)$ is the problem of assigning non-negative integers (known as labels) from the set $\{0, \ldots, \lambda\}$ to the vertices of $G$ such that if any two vertices in $V$ are one, two and three distance apart from each other then the assigned labels to these vertices must have a difference of at least $D$, 2 and 1 respectively. The vertices which are at least $4$ distance apart can receive the same label. The minimum value among all the possible values of $\lambda$ for which there exists a $\lambda$-$L(D, 2, 1)$-$labeling$ is known as the labeling number. In this paper $\lambda$-$L(D, 2 ,1)$-$labeling$ of square grid is considered. The lower bound on the labeling number for square grid is presented and a formula for $\lambda$-$L(D, 2 ,1)$-$labeling$ of square grid is proposed. The correctness proof of the proposed formula is given here. The upper bound of the labeling number obtained from the proposed labeling formula for square grid matches exactly with the lower bound of the labeling number. |
|---|
| Keywords: | Graph labeling, Square grid, Labeling number, Frequency assignment problem (FAP) |
|---|
| Year of publishing: | 2019 |
|---|
| Number of pages: | 485-487 |
|---|
| Numbering: | 6, 42 |
|---|
| PID: | 20.500.12556/RUNG-8141 |
|---|
| COBISS.SI-ID: | 149328643 |
|---|
| DOI: | https://doi.org/10.1007/s40009-018-0780-5 |
|---|
| NUK URN: | URN:SI:UNG:REP:VMO9ZZMV |
|---|
| Publication date in RUNG: | 17.04.2023 |
|---|
| Views: | 1500 |
|---|
| Downloads: | 0 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
