Title: | L(4, 3, 2, 1)-Labeling for Simple Graphs |
---|
Authors: | ID Atta, Soumen, Department of Computer Science and Engineering, University of Kalyani, Nadia, West Bengal, India (Author) ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering, University of Kalyani, Nadia, West Bengal, 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.08 - Published Scientific Conference Contribution |
---|
Organization: | UNG - University of Nova Gorica
|
---|
Abstract: | An L(4, 3, 2, 1)-labeling of a graph is a function which assigns label to each vertex of the graph such that if two vertices are one, two, three and four distance apart then assigned labels must have a difference of at least 4, 3, 2 and 1 respectively between them. This paper presents L(4, 3, 2, 1)-labeling number for simple graphs such as complete graphs, complete bipartite graphs, stars, paths and cycles. This paper also presents an L(4, 3, 2, 1)-labeling algorithm for paths which is optimal for paths on n≥7 vertices. |
---|
Keywords: | L(4, 3, 2, 1)-labeling, Labeling number, Graph labeling, Channel assignment problem |
---|
Publication status: | Published |
---|
Year of publishing: | 2015 |
---|
Number of pages: | 511-518 |
---|
PID: | 20.500.12556/RUNG-8240 |
---|
COBISS.SI-ID: | 154436867 |
---|
DOI: | https://doi.org/10.1007/978-81-322-2250-7_50 |
---|
NUK URN: | URN:SI:UNG:REP:H4B43GOJ |
---|
Publication date in RUNG: | 05.06.2023 |
---|
Views: | 1504 |
---|
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. |