L(3,2,1) LABELLINGS OF SOME TREE GRAPH CLASSES
Let G = (V;E) be a graph. An L(3,2,1) labelling of G is a function f : V ! N [ f0g such that for every u; v 2 V , jf(u) ???? f(v)j 3 if d(u; v) = 1, jf(u)????f(v)j 2 if d(u; v) = 2, and jf(u)????f(v)j 1 if d(u; v) = 3. Let k 2 N, a k ????L(3; 2; 1) labelling is a labelling L(3,2,1) where all l...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/36113 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |