4-Caterpillars的優美標法

• Main Authors: 吳文智, Wu, Wen Chih
• Language: 英文
• Published: 國立政治大學
• Subjects: 樹; 優美圖; Trees; graceful labelling; 4-Caterpillars; 4-stars
• Online Access: http://thesis.lib.nccu.edu.tw/cgi-bin/cdrfb3/gsweb.cgi?o=dstdcdr&i=sid=%22G0091751009%22.

樹是一個沒有迴路的連接圖。而4-caterpillar是一種樹，它擁有單一路徑連接到數個長度為3的路徑的端點。一個有n個邊的無向圖G的優美標法是一個從G的點到{0,1,2,...,n}的一對一函數，使得每一個邊的標號都不一樣，其中，邊的標號是兩個相鄰的點的編號差的絕對值。在這篇論文當中，我們最主要的目的是使用一個演算法來完成4-caterpillars的優美標法。 === A tree is connected acyclic graph. A 4-caterpillar is a tree with a single path only incident to the end-vertices of paths of length 3. A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0,1,2,...,n} such that the induced edge labels are all distinct, where the edge label is the difference between two endvertex labels. In this thesis, our main purpose is to use an algorithm to yield graceful labellings of 4-caterpillars.