Leese, R.A. and Noble, Steven (2004) Cyclic labelling with constraints at two distances. The Electronic Journal of Combinatorics 11 (1), ISSN 1077-8926.
Abstract
Motivated by problems in radio channel assignment, we consider the vertex-labelling of graphs with nonnegative integers. The objective is to minimize the span of the labelling, subject to constraints imposed at graph distances one and two. We show that the minimum span is (up to rounding) a piecewise linear function of the constraints, and give a complete specification, together with the associated optimal assignments, for trees and cycles.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | Article number: R16 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 20 Jul 2020 12:29 |
| Last Modified: | 09 Aug 2023 12:48 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/32602 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
