| Naslov: | L(4, 3, 2, 1)-Labeling for Simple Graphs |
|---|
| Avtorji: | ID Atta, Soumen, Department of Computer Science and Engineering, University of Kalyani, Nadia, West Bengal, India (Avtor)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering, University of Kalyani, Nadia, West Bengal, India (Avtor) |
|---|
| Datoteke: |
Gradivo nima datotek, ki so prostodostopne za javnost. Gradivo je morda fizično dosegljivo v knjižnici fakultete, zalogo lahko preverite v COBISS-u.  |
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Delo ni kategorizirano |
|---|
| Tipologija: | 1.08 - Objavljeni znanstveni prispevek na konferenci |
|---|
| Organizacija: | UNG - Univerza v Novi Gorici
|
|---|
| Opis: | 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. |
|---|
| Ključne besede: | L(4, 3, 2, 1)-labeling, Labeling number, Graph labeling, Channel assignment problem |
|---|
| Status publikacije: | Objavljeno |
|---|
| Leto izida: | 2015 |
|---|
| Št. strani: | 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 |
|---|
| Datum objave v RUNG: | 05.06.2023 |
|---|
| Število ogledov: | 685 |
|---|
| Število prenosov: | 0 |
|---|
| Metapodatki: |     |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
