Shifted-Antimagic Labelings for Graphs

機構典藏 > College of Business and Management > Graduate Institute & Department of Accounting > Journal Article > Item 987654321/120473

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/120473

Title:	Shifted-Antimagic Labelings for Graphs
Authors:	Pan, Zhi-shi
Keywords:	Antimagic labeling;Disconnected graphs;Trees
Date:	2021-03
Issue Date:	2021-04-08 12:10:19 (UTC+8)
Abstract:	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.
Relation:	Graphs and Combinatorics 37(2),　p.1065-1082
DOI:	10.1007/s00373-021-02305-w
Appears in Collections:	[Graduate Institute & Department of Accounting] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	78	View/Open
Shifted-Antimagic Labelings for Graphs.pdf		390Kb	Adobe PDF	70	View/Open