On (2,1)-total labelings of 4-regular graphs
碩士 === 中原大學 === 應用數學研究所 === 100 === LetG=(V,E) be a graph. A (2,1)-total labeling of G is a mapping from V∪E into {0,…, λ} for some integer λ such that: (i) if x and y are adjacent vertices, then l(x) not equal l(y) ;(ii) if e and f are adjacent edges, then l(e) not equal l(f) ;(iii) if an edge e is...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/26323196773275600528 |