圖的α-標號的研究

On α-labeling graphs

呂中明(Chung-Ming Lu)

指導教授 ： 史青林

中原大學/理學院/應用數學研究所/碩士(2005年)

https://doi.org/10.6840/cycu200500173

摘要

令圖形G擁有q條邊(edges)，則一個對映函數(injection function) f :V(G)→{0,1,2,3,…,q}，我們稱為圖形G一個β-labeling，是將圖形的每一個節點(vertices)從0到q加以編號，並將每對比鄰的節點uv做 |f(u)-f(v)| 的運算(共計q對)，其所得到的值皆不同(distinct)。一個β-labeling也被稱為是一個完美的編號Graceful labeling。
若函數f為圖形G的β-labeling，且存在一個正整數λ，我們稱之為臨界值(critical value)，對每一個E(G)上的邊{u, v}，皆滿足f(u)≦λ

關鍵字

圖的α-標號的研究

並列摘要

Let G be a graph with q edges, then an injection function f: V(G)→ {0,1,2,3,…,q} is called a β-labeling of G provides that the values |f(u)-f(v)| for the q pairs of adjacent vertices u and v are distinct. A β- labeling is also known as a Graceful labeling.
If f is a β-lableing of G and there exists an integer λ which is called a critical value such that for each edge {u,v}ÎE(G) either f(u)≦λ

並列關鍵字

On α-labeling graphs

參考文獻

[1]S. El-Zanati, H.L.Fu, C.L.Shiue, On the α-labeling number of biparate graphs, Discrete Math. 214(2000),241-243

[2]S. El-Zanati and C. Vanden Eynden, Decompositions of K_{m,n} into cubes, J. comb. Designs 4(1996)51-57.

[4]J.F. Fink, On the decomposition of n-cube into isomorphic trees, J.Graphs Theory 14(1990),pp.405-411

[5]G. Ringel, Program 25, in Theory of Graphs and its Applications, Proc. Symposium Smolenice 1963, Prague (1964) 162

[6]G. Ringel, A. Loado and O. serra, Decomposition of complete bipartite graph into trees, DMAT Research Report 11/96 Univ. Politecnica de Catalunya.