Brunel University Research Archive (BURA) >
Research Areas >
Computer Science >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/590

Title: Cyclic labellings with constraints at two distances
Authors: Leese, R
Noble, S D
Keywords: Frequency assignment
Minimum span
Graph labelling
Radio channel assignment
Publication Date: 2004
Publisher: Electronic Journal of Combinatorics
Citation: Electronic Journal of Combinatorics 11(1): R16, Feb 2004
Abstract: Motivated by problems in radio channel assignment, we consider the vertex-labelling of graphs with non-negative integers. The objective is to minimise 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 associated optimal assignments, for trees and cycles.
URI: http://bura.brunel.ac.uk/handle/2438/590
ISSN: 1077-8926
Appears in Collections:Mathematical Science
Computer Science

Files in This Item:

File Description SizeFormat
cycles.pdf131.37 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan