教師資料查詢 | 類別: 期刊論文 | 教師: 潘志實ZHISHI PAN (瀏覽個人網頁)

標題:Shifted-Antimagic Labelings for Graphs
學年109
學期2
出版(發表)日期2021/03/30
作品名稱Shifted-Antimagic Labelings for Graphs
作品名稱(其他語言)
著者Fei-Huang Chang; Hong-Bin Chen; Wei-Tian Li; Zhishi Pan
單位
出版者
著錄名稱、卷期、頁數Graphs and Combinatorics,37,p.1065–1082
摘要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.
關鍵字Antimagic labeling;Disconnected graphs;Trees
語言英文(美國)
ISSN0911-0119
期刊性質國外
收錄於SCI;
產學合作
通訊作者Wei-Tian Li
審稿制度
國別瑞士
公開徵稿
出版型式,電子版,紙本
相關連結
SDGs
Google+ 推薦功能,讓全世界都能看到您的推薦!