English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49925/85107 (59%)
Visitors : 7781365      Online Users : 57
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106203

    Title: Antimagic labeling of regular graphs
    Authors: Feihuang Chang;Yu-Chang Liang;Zhishi Pan;Xuding Zhu
    Keywords: antimagic;regular graph;labeling
    Date: 2015-08-24
    Issue Date: 2016-04-22 13:41:36 (UTC+8)
    Publisher: John Wiley & Sons, Inc.
    Abstract: A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., |E|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e). It is known that bipartite regular graphs are antimagic and nonbipartite regular graphs of odd degree at least three are antimagic. Whether all nonbipartite regular graphs of even degree are antimagic remained an open problem. In this article, we solve this problem and prove that all even degree regular graphs are antimagic.
    Relation: Journal of Graph Theory 82(4), pp.339-349
    DOI: 10.1002/jgt.21905
    Appears in Collections:[數學學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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