最大度为7的哈林图的L(2,1)-标号  

L(2,1)-labelling of Halin graphs with a maximum degree of seven

作　　者：陈晓峰 王艺桥[1] CHEN Xiao-feng;WANG Yi-qiao(School of Management,Beijing University of Chinese Medicine,Beijing 100029,China)

机构地区：[1]北京中医药大学管理学院,北京100029

出　　处：《华东师范大学学报（自然科学版）》2019年第1期39-47,57,共10页Journal of East China Normal University(Natural Science)

基　　金：国家自然科学基金(11671053)

摘　　要：哈林图是一个平面图G=T∪C,其中T是嵌入到平面内的不含2度点且至少有一个顶点度大于等于3的树,C是按顺时针顺序依次连接T中的叶形成的圈.通过对哈林图的结构分析,证明了最大度等于7的哈林图的L(2,1)-标号数至多为10.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.

关 键 词：哈林图 L(2 1)-标号 最大度 

分 类 号：O157.5[理学—数学]