The antimagic graph with a generalization
碩士 === 國立中央大學 === 數學系 === 103 === A graph G is called an antimagic graph if exists an edge labeling with labels 1,2,⋯,|E(G)| such that all vertex sums are distinct. In this paper, Section 1 is the introduction of antimagic graph. In Section 2, we prove that the union of a path and some stars is ant...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/3mp67x |