The oriented-k-graceful labelings of graphs
碩士 === 國立東華大學 === 應用數學系 === 95 === Given a graph $G$ with $n$ vertices and a function $L:V(G) ightarrow2^{mathbb{N}}$, Let $G$ be a graph with $|V(G)|=n$ and $|E(G)|=m$, a extit{graceful labeling} of is a one-to-one function $f:V(G) ightarrow {0,1,2,...,m}$ such that ${|f(u)-f(v)|:uvin E(G)}={1,2,c...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/8h38p4 |