Geodesic
Cyclic labellings with constraints at two distances
The electronic journal of combinatorics, Tome 11 (2004) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1769
Classification : 05C78, 05C15
Mots-clés : labelling, distances, trees, cycles 
@article{10_37236_1769,
     author = {R. A. Leese and S. D. Noble},
     title = {Cyclic labellings with constraints at two distances},
     journal = {The electronic journal of combinatorics},
     year = {2004},
     volume = {11},
     number = {1},
     doi = {10.37236/1769},
     zbl = {1053.05111},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1769/}
}
TY  - JOUR
AU  - R. A. Leese
AU  - S. D. Noble
TI  - Cyclic labellings with constraints at two distances
JO  - The electronic journal of combinatorics
PY  - 2004
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1769/
DO  - 10.37236/1769
ID  - 10_37236_1769
ER  - 
%0 Journal Article
%A R. A. Leese
%A S. D. Noble
%T Cyclic labellings with constraints at two distances
%J The electronic journal of combinatorics
%D 2004
%V 11
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1769/
%R 10.37236/1769
%F 10_37236_1769
R. A. Leese; S. D. Noble. Cyclic labellings with constraints at two distances. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1769

Cité par Sources :