%A CHEN Xiao-feng, WANG Yi-qiao
%T *L*(2, 1)-labelling of Halin graphs with a maximum degree of seven
%0 Journal Article
%D 2019
%J Journal of East China Normal University(Natural Science)
%R 10.3969/j.issn.1000-5641.2019.01.005
%P 39-47,57
%V 2019
%N 1
%U {https://xblk.ecnu.edu.cn/CN/abstract/article_25580.shtml}
%8 2019-01-25
%X A Halin graph is a plane graph *G*=*T* ∪ *C*, where *T* is a tree with no vertex of degree 2 and at least one vertex of degree 3 or more, and *C* is a cycle connecting the leaves of *T* in the cyclic order determined by the drawing of *T*. After structural analysis of Halin graphs, we show that the *L*(2,1)-labelling number of every Halin graph *G* with a maximum degree 7 is at most 10.