Distance Two Labelings on Graphs
碩士 === 國立臺灣大學 === 數學研究所 === 93 === An L(2,1)-labeling of a graph G is a function f : V (G) → N∪{0} such that for all u, v in V(G), we have |f(u) − f(v)| is not less than 2 if d(u,v) = 1, and |f(u) − f(v)| is not less than 1 if d(u,v) = 2. The L(2,1)-labeling number λ(G) of G is the smallest number k...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/05222790453510722050 |