Please use this identifier to cite or link to this item:

Title: 完全圖上的(a, d)-antimagic 圖標號
On (a, d)-antimagic labelings of complete graphs
Authors: 莊崴宇
Chuang, Wi-Yu
Contributors: 張宜武
Chang, Yi-Wu
Chuang, Wi-Yu
Keywords: 圖標號
Graph labelings
Date: 2020
Issue Date: 2020-08-03 17:58:02 (UTC+8)
Abstract: 圖標號是將整數分配到一個圖的邊或點。圖標號的發展源起於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.
Reference: [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.
Description: 碩士
Source URI:
Data Type: thesis
Appears in Collections:[應用數學系] 學位論文

Files in This Item:

File Description SizeFormat
101201.pdf540KbAdobe PDF37View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing