Cactus图的L(j,k)-标号数研究  

Study on the L(j,k)-labelling number of Cactus graph

作　　者：吴琼 吕晓静[1] WU Qiong;LYU Xiao-jing(School of Science, Tianjin University of Technology and Education,Tianjin 300222, China)

机构地区：[1]天津职业技术师范大学理学院,天津300222

出　　处：《天津职业技术师范大学学报》2019年第1期31-33,38,共4页Journal of Tianjin University of Technology and Education

基　　金：国家自然科学基金资助项目(11601391);天津市自然科学基金资助项目(18JCQNJC69700)

摘　　要：针对计算机无线网络代码分配问题,先利用一系列Cactus图来刻画计算机的无线网络,再把无线网络代码分配问题抽象为Cactus图的L(j,k)-标号问题。进而,针对几类Cactus图的L(j,k)-标号数展开研究,确定了二元圈、p元圈的Cactus图的L(1,2)-标号数。To solve the code assignment problem of the computer wireless network , a series of Cactus graphs was used to describe1 the computer wireless network , and the code assignment problem was abstracted as the L(j,k)- labelling problem of Cactus graphs. Then , the L(J,k)- labelling number of several types of Cactus graphs was studied,and L(1 ,2)- labelling numbers of Cactus graph with 2 and p induced cycles are obtained.

关 键 词：代码分配问题 L(j k)-标号数 Cactus图 

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