跳到主要內容

簡易檢索 / 詳目顯示

研究生: 莊崴宇
Chuang, Wi-Yu
論文名稱: 完全圖上的(a, d)-antimagic 圖標號
On (a, d)-antimagic labelings of complete graphs
指導教授: 張宜武
Chang, Yi-Wu
口試委員: 蔡炎龍
Tsai, Yen-lung
陳天進
Chen, Ten-Ging
學位類別: 碩士
Master
系所名稱: 理學院 - 應用數學系
Department of Mathematical Sciences
論文出版年: 2020
畢業學年度: 108
語文別: 中文
論文頁數: 12
中文關鍵詞: 圖標號
外文關鍵詞: Graph labelings
DOI URL: http://doi.org/10.6814/NCCU202000786
相關次數: 點閱:268下載:16
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 圖標號是將整數分配到一個圖的邊或點。圖標號的發展源起於1967年,由Rosa所提出,在1990年,Hartsfield 和 Ringel 引進了 antimagic graph的概念,而(a, d)-antimagic graph 的觀念則是Bodendiek 和 Walther在1993年引入,詳細的資料可以在[2]中參考。在本篇論文我們探討一些(a, d)-antimagic 圖標號的概念,特別是探討完全圖的(a, d)-antimagic 圖標號。


    A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labeling methods was introduced by Rosa in 1967.
    Hartsfield and Ringel introduced the concept of an antimagic graph in 1990. The concept of an $(a, d)$-antimagic labelings was introduced by Bodendiek and Walther in 1993. See [2] for further introduction.
    In this paper, we investigate properties of an $(a, d)$-antimagic graph. In particular, we study the $(a, d)$-antimagic labelings of complete graphs.

    致謝 i
    中文摘要 ii
    Abstract iii
    Contents iv
    List of Figures v
    1 Introduction 1
    2 Examples 3
    2.1 Cycles, Paths, and Stars 3
    2.2 Complete graphs Kn 5
    3 Main results 7
    3.1 K4 is not (a, d)-antimagic 7
    3.2 Main results 9
    3.3 Conclusion 11
    Bibliography 12

    [1] R. Bodendiek and G. Walther. On arithmetic antimagic edge labelings of graphs. Mitt. Math. Ges. Hamburg, 17 (1998) 8599., 1998.
    [2] Joseph Gallian. A dynamic survey of graph labeling. Electron J Combin DS6, 19, 11 2000.

    QR CODE
    :::