Antimagicness of regular graphs
碩士 === 國立政治大學 === 應用數學系 === 106 === An antimagic labeling of a graph G with m edges is a bijection from E(G) to 1, 2,..., m such that for all vertices u and v, the sum of labels on edges incident to u differs from edges incident to v. Hartsfield and Ringel conjectured that every connected graph othe...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/q7smy2 |
| Summary: | 碩士 === 國立政治大學 === 應用數學系 === 106 === An antimagic labeling of a graph G with m edges is a bijection from E(G) to 1, 2,..., m such that for all vertices u and v, the sum of labels on edges incident to u differs from edges incident to v.
Hartsfield and Ringel conjectured that every connected graph other than K2 has an antimagic labeling. We prove it is true for k-regular Graph when k≥2.
|
|---|