The edge distinguishing number of the 3-regular Halin graphs
Yi Li · Journal of Science of Teachers' College and University · 2011
According to the Hamilton property of the 3-regular graph,and combining with the adjacent relations of the edges,proven that the edge distinguishing number of 3-regular graphG is respectively 3 and 2 on 4 and above 6 vertices by selecting edges properly and coloring.