Cyclic labellings with constraints at two distances (Q1883626): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q221681 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Steven D. Noble / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 06:04, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cyclic labellings with constraints at two distances |
scientific article |
Statements
Cyclic labellings with constraints at two distances (English)
0 references
13 October 2004
0 references
Summary: 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.
0 references
labelling
0 references
distances
0 references
trees
0 references
cycles
0 references
