  We give bounds on the L(2,1)-labeling number of a simple graph in terms of
its order and its maximum degree. We also describe an infinite class of graphs
of which the elements have the highest L(2,1)-labeling numbers in terms of
their maximum degrees of any known infinite class of graphs.
