基于书图的计算机无线网络的代码分配

Code assignment in computer wireless network based on book graph

把一些计算机无线网络抽象概括为书图,并利用书图的L(1,d)-标号问题模拟一些计算机无线网络的代码分配问题.针对书图的L(1,d)-标号问题(d≥2)展开研究,来确定计算机无线网络的最优代码数及其分配方案.给出了书图的L(1,d)-标号函数,确定了书图的L(1,d)-标号数的上界,另外,根据书图的性质以及结构特征,确定了书图的L(1,d)-标号数的下界,得到书图的L(1,d)-标号数.

Some computer wireless networks are abstracted as book graphs,and code assignment problems of these computer wireless networks are simulated by the L(1,d)-labeling problem of book graphs.In order to minimize the number of codes for computer wireless network,works on the problem of L(1,d)-labeling of book graph,where d≥2.The L(1,d)-labeling function of book graph is given to find the upper bound on L(1,d)-labeling number of book graph.Moreover,the lower bound on the L(l,d)-labeling number of book graph is determined according to the properties and construction characteristics of book graph,and finally the L(l,d)-labeling number of the book graph is found.