Cyclic labellings with constraints at two distances

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Leese, R	-
dc.contributor.author	Noble, S D	-
dc.coverage.spatial	16	en
dc.date.accessioned	2007-01-30T09:11:50Z	-
dc.date.available	2007-01-30T09:11:50Z	-
dc.date.issued	2004	-
dc.identifier.citation	Electronic Journal of Combinatorics 11(1): R16, Feb 2004	en
dc.identifier.issn	1077-8926	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/590	-
dc.description.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.	en
dc.format.extent	134525 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Electronic Journal of Combinatorics	en
dc.subject	Frequency assignment	en
dc.subject	Minimum span	en
dc.subject	Graph labelling	en
dc.subject	Radio channel assignment	en
dc.title	Cyclic labellings with constraints at two distances	en
dc.type	Research Paper	en
Appears in Collections:	Computer Science Mathematical Sciences

Files in This Item:

File	Description	Size	Format
cycles.pdf		131.37 kB	Adobe PDF	View/Open