The antimagic graph with a generalization

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/66915

Title:	The antimagic graph with a generalization
Authors:	黃衍勝;Huang,Yan-sheng
Contributors:	數學系
Keywords:	圖論;反魔術
Date:	2015-01-14
Issue Date:	2015-03-16 16:00:04 (UTC+8)
Publisher:	國立中央大學
Abstract:	反魔術圖是圖形的一種標號,當我們找到一種標號方式使得圖形的所有點之和都不相同時,我們稱這種圖形是反魔術圖。在這篇論文中,第一章我們討論反魔術圖的一些基本定義,第二章證明路徑(path)與星林(star forest)的聯集,在每一分量(component)的邊數都大於等於3的情況下是反魔術圖,第三章討論更廣義的反魔術性質,也證明了環路(cycle),完全圖(complete),輪子(wheel),風箏(kite)都是廣義的反魔術圖。 ;A graph G is called an antimagic graph if exists an edge labeling with labels 1,2,⋯,\|E(G)\| such that all vertex sums are distinct. In this paper, Section 1 is the introduction of antimagic graph. In Section 2, we prove that the union of a path and some stars is antimagic. Section 3 is the introduction of antimagic with a generalization, and we prove that cycles, complete graphs, wheels and kites are R-antimagic.
Appears in Collections:	[Graduate Institute of Mathematics] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	603	View/Open

社群 sharing