English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 58796/92528 (64%)
造訪人次 : 639076      線上人數 : 36
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/121001

    題名: Shifted-Antimagic Labelings for Graphs
    作者: Chang, Fei-Huang;Chen, Hong-Bin;Li, Wei-Tian;Pan, Zhishi
    關鍵詞: 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
    顯示於類別:[數學學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋