Graph labellings with variable weights, a survey

GRIGGS, JR and Daniel KRÁĽ. Graph labellings with variable weights, a survey. Discrete Applied Mathematics. AMSTERDAM: Elsevier B.V., 2009, vol. 157, No 12, p. 2646-2658. ISSN 0166-218X. Available from: https://doi.org/10.1016/j.dam.2008.08.024.

Basic information

Original name

Graph labellings with variable weights, a survey

Authors

GRIGGS, JR and Daniel KRÁĽ

Edition

Discrete Applied Mathematics, AMSTERDAM, Elsevier B.V. 2009, 0166-218X

---

Other information

Language

English

Type of outcome

Article in a journal

Confidentiality degree

is not subject to a state or trade secret

Impact factor

Impact factor: 0.816

DOI

https://doi.org/10.1016/j.dam.2008.08.024

UT WoS

000267627800008

Keywords in English

Distance constrained labeling; Real number graph labeling; L(p, q)-labeling

---

Abstract

In the original language

Graph labellings form an important graph theory model for the channel assignment problem. An optimum labelling usually depends on one or more parameters that ensure minimum separations between frequencies assigned to nearby transmitters. The study of spans and of the structure of optimum labellings as functions of such parameters has attracted substantial attention from researchers, leading to the introduction of real number graph labellings and lambda-graphs. We survey recent results obtained in this area. (C) 2008 Elsevier B.V. All rights reserved.