On Antimagic Labeling of Graphs
碩士 === 大同大學 === 應用數學學系(所) === 97 === Let G=(V,E) be an undirected graph with p vertices and q edges. Let f be a bijection function from E to {1,2,...q}. Then f is an antimagic labeling of G if the induced vertex sum is injective. If G has an antimagic labeling then we say G is antimagic. Furthermore...
Main Authors: | Tsung-han Wu, 吳宗翰 |
---|---|
Other Authors: | Nam-po Chiang |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/67394518178892586738 |
Similar Items
-
Antimagic Labelings on Disconnected Graphs
by: Raphita Yanisari Silalahi, et al.
Published: (2019) -
Decompositions and Antimagic Labelings of Graphs
by: Zhen-Chun Chen, et al.
Published: (2015) -
on Graph Labeling Problems of Antimagic Type
by: Cheng-Chih Hsiao, et al.
Published: (2006) -
Two Edge Labelings in Graphs :Graph Decomposition and Antimagic Labeling
by: Ying-Ren Chen, et al.
Published: (2013) -
On d-antimagic labelings of plane graphs
by: Martin Baca, et al.
Published: (2013-04-01)