Algorithmic Aspeect of the L(d,1)-labelling on Trees:Revisited
碩士 === 逢甲大學 === 應用數學研究所 === 86 === The L(d,1)-labeling of a graph G is a function f from V(G) to the set of all nonnegative integers such that |f(x)-f(y)|>=d if d(x,y)=1 and |f(x)-f(y)|>=1 if d(x,y)=2. A k-L(d,1)-labeling is an L(d,1)-labeling such that no label is greater then k. The L( d,1)-...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93868523837672887801 |