Shifted-Antimagic Labelings for Graphs

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

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

题名:	Shifted-Antimagic Labelings for Graphs
作者:	Pan, Zhi-shi
关键词:	Antimagic labeling;Disconnected graphs;Trees
日期:	2021-03-30
上传时间:	2021-08-24 12:11:23 (UTC+8)
出版者:	Springer Nature
摘要:	The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees. This paper studies a weak version called k-shifted-antimagic labelings which allow the consecutive numbers starting from k+1, instead of starting from 1, where k can be any integer. This paper establishes connections among various concepts proposed in the literature of antimagic labelings and extends previous results in three aspects: Some classes of graphs, including trees and graphs whose vertices are of odd degrees, which have not been verified to be antimagic are shown to be k-shifted-antimagic for sufficiently large k. Some graphs are proved k-shifted-antimagic for all k, while some are proved not for some particular k. Disconnected graphs are also considered.
關聯:	Graphs and Combinatorics 37,　p.1065-1082
DOI:	10.1007/s00373-021-02305-w
显示于类别:	[數學學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	70	检视/开启

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

TAIR相关文章