|
Organizers |
Minimum Span Graph Labellings with Separation Conditions
by
Jerrold R. Griggs
University of South Carolina, Columbia, SC, USA
The theory of integer vertex l-labellings of a graph models the efficient assignment of channels to a network of transmitters. One seeks the minimum span of a labelling such that labels for vertices at distance i are separated by at least a specified amount ki. We present an overview of the considerable recent progress and future challenges, both on the original case (k1=2 and k2=1) and on more general models of real-number labellings of infinite graphs.
Date received: May 12, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-74.