Christopher A. Wood

A Complete L(2,1) Span Characterization for Small Trees

C. A. Wood and J. Jacob

Materials

Abstract

An L(2, 1) labeling of a graph G is a vertex labeling such that any pair of vertices v_i and v_j must have labels at least 2 apart if d(v_i,v_j) = 1 and labels at least 1 apart if d(v_i,v_j) = 2. The span of an L(2,1) labeling f on a graph G is the maximum f(u) for all u ∈ V (G). The L(2, 1) span of a graph G is the minimum span of all L(2, 1) labelings on G. The L(2, 1) labeling on trees has been extensively studied in recent years. In this paper we present a complete characterization of the L(2, 1) span of trees up to twenty vertices.

BibTeX

@article{wood2015complete,
 title={A complete L (2, 1) span characterization for small trees},
 author={Wood, Christopher A and Jacob, Jobby},
 journal={AKCE International Journal of Graphs and Combinatorics},
 volume={12},
 number={1},
 pages={26--31},
 year={2015},
 publisher={Elsevier}
 }