期刊論文
| 學年 | 109 |
|---|---|
| 學期 | 2 |
| 出版（發表）日期 | 2021-03-30 |
| 作品名稱 | Shifted-Antimagic Labelings for Graphs |
| 作品名稱（其他語言） | |
| 著者 | Pan, Zhi-shi |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | Graphs and Combinatorics 37(2), 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 |
| 語言 | en_US |
| ISSN | 1435-5914 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | Wei-Tian Li |
| 審稿制度 | 是 |
| 國別 | JPN |
| 公開徵稿 | |
| 出版型式 | ,電子版 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/120473 ) |