Distance two-labelings of the corona of two graphs
碩士 === 國立臺灣大學 === 數學研究所 === 91 === Given a graph $G=(V,E)$, a $k$-$L(2,1)$-labeling of $G$ is a function $f$ from the vertex set $V(G)$ to $\{ 0,1,\cdots ,k\} $ such that $|f(u)-f(v)| \geq 1$ if $d(u,v)=2$ and $|f(u)-f(v)| \geq 2$ if $d(u,v)=1$. The $L(2,1...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02405372982929454520 |