Distance-two labelings of Hamming graphs
碩士 === 國立臺灣大學 === 數學研究所 === 91 === An $L(2,1)$-labeling of a graph $G$ is a function $f$ from the vertex set $V(G)$ to the set of all nonnegative integers such that $|f(u)-f(v)|\geq 2$ if $d(u,v)=1$ and $|f(u)-f(v)|\geq 1$ if $d(u,v)=2$. For a nonnegative integer $k$, a $k$-$L(2,1)$-label...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/79990950317378572849 |