The L(3,2,1)-labeling of graphs
博士 === 國立東華大學 === 應用數學系 === 95 === Given a graph G, the L(3,2,1)-labeling of G is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(u)-f(v)|>=1 if d(u,v) = 3, |f(u)-f(v)|>=2 if d(u,v) = 2, and |f(u)-f(v) |>=3 if d(u,v) = 1, For a nonnegative integer k...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/dsw77k |