On the Distinguishing Number of Halin Graphs with △(G)=6
Ding Wen-long · Journal of Jiamusi University · 2008
Combining with the distinguishing number of cycle Cn with n vertices,this paper proves and obtains that the distinguishing number of Halin graph G with △(G) = 6 is 2 on n vertices.△(G) denotes maximum degree of Halin graph G.