Labeling Graphs with Two Distance-Constraints
碩士 === 國立東華大學 === 應用數學系 === 90 === Given a graph G, an L(d_{1},d_{2};p,q)-labeling of G is a function f:V(G)-->{0,1,2,...,n} such that |f(u)-f(v)|>= p if d_{G}(u,v)<= d_{1} and |f(u)-f(v)|>= q if d_{G}(u,v)<= d_{2}. A k-L(d_{1},d_{2};p,q)-labeling is an L(d_{1},d_{2};p,q)-labeling f s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/38557388216266771649 |