Antimagic labeling of regular graphs

淡江大學機構典藏 > 理學院 > 數學學系暨研究所 > 期刊論文 > Item 987654321/106203

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/106203

题名:	Antimagic labeling of regular graphs
作者:	Feihuang Chang;Yu-Chang Liang;Zhishi Pan;Xuding Zhu
关键词:	antimagic;regular graph;labeling
日期:	2015-08-24
上传时间:	2016-04-22 13:41:36 (UTC+8)
出版者:	John Wiley & Sons, Inc.
摘要:	A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., \|E\|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e). It is known that bipartite regular graphs are antimagic and nonbipartite regular graphs of odd degree at least three are antimagic. Whether all nonbipartite regular graphs of even degree are antimagic remained an open problem. In this article, we solve this problem and prove that all even degree regular graphs are antimagic.
關聯:	Journal of Graph Theory 82(4), pp.339-349
DOI:	10.1002/jgt.21905
显示于类别:	[數學學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
Antimagic labeling of regular graphs.pdf		200Kb	Adobe PDF	1	检视/开启
index.html		0Kb	HTML	216	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章