English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 58286/91808 (63%)
造访人次 : 13821978      在线人数 : 66
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


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


    题名: 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-04-08 12:10:19 (UTC+8)
    摘要: 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(2)
    DOI: 10.1007/s00373-021-02305-w
    显示于类别:[會計學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML7检视/开启

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

    TAIR相关文章

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