A complete L(2,1) span characterization for small trees
An L(2,1) labeling of a graph G is a vertex labeling such that any pair of vertices vi and vj must have labels at least 2 apart if d(vi,vj)=1 and labels at least 1 apart if d(vi,vj)=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 t...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2015-07-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860015000055 |