Publication details
Graph labellings with variable weights, a survey
| Authors | |
|---|---|
| Year of publication | 2009 |
| Type | Article in Periodical |
| Magazine / Source | Discrete Applied Mathematics |
| Citation | |
| Doi | http://dx.doi.org/10.1016/j.dam.2008.08.024 |
| Keywords | Distance constrained labeling; Real number graph labeling; L(p, q)-labeling |
| Description | 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. |