雙蜘蛛圖的強反魔方標號

The strongly anti-magic labeling of double spider graphs

金斌輝(Pin-Hui Chin)

指導教授 ： 潘志實

淡江大學/理學院/數學學系碩士班/碩士(2017年)

https://doi.org/10.6846/TKU.2017.01063

摘要

給定任意圖G=(V,E)，|V(G)|=n， |E(G)|=m，圖G的一個標號f:E→{1,2,…,m}為一雙射函數。假設對於任意頂點u，令
s(u)=∑_(e∈E(u))〖f(e)〗，其中E(u)為所有與u相連的邊的集合，若對於任意i≠j，s(i)≠s(j)，則稱此標號為反魔方標號。假設f是一個圖G的反魔方標號，令deg⁡(u)為所有與u相連的邊的數量總和，若對於任意兩個不同的頂點u,v，deg⁡(u)

關鍵字

強反魔方 ； 雙蜘蛛圖 ； 標號

並列摘要

Let G=(V,E) be a simple graph with n vertices and m edges. A labeling of G is a bijection from the set of edges to the set {1,2,…,m} of integers, for each vertex, its vertex sum is defined to be the sum of labels of all edges incident to it. If all vertices have distinct vertex sums, we call this labeling anti-magic. Suppose f is an anti-magic labeling of G, and for any two vertices u,v with deg(u) < deg(v), if vertex sum of u is strictly less than vertex sum of v, then we say f is a strongly anti-magic labeling of G.

In this thesis, we restrict our graphs to double spider graphs. Since some of double spider graphs have already been proven to be anti-magic, we will prove a stronger result here, that is, all double spider graphs are strongly anti-magic.

並列關鍵字

strongly anti-magic ； double spider graphs

參考文獻

[16] 黃梓彥, 蜘蛛圖的反魔方標號, 2015.

[1] N.Alon, Combinatorial Nullstellensatz, Combin Probab Comput 8 (1999), 7-29.

[2] N.Alon, G. Kaplan, A.Lev, Y.Roditty, and R. Yuster, Dense graphs are antimagic, J.Graph Theory 47 (2004), 297-309.

[3] F. Chang, Y.-C. Liang, Z. Pan, X. Zhu, Antimagic labeling of regular graphs, J.Graph Theory 82 (2016), 339-349.

[4] D. W. Cranston, Regular bipartite graphs are antimagic, J. Graph Theory 60 (2009),173-182.