路的L(1,2)-可选择数

L(1,2)-choosability of path

为了解决计算机无线网络中的代码匮乏问题,利用路去刻画一类无线网络.通过研究路的L(1,2)-可选择数问题,可以得到无线网络中每个计算机站点的可用代码,保证计算机站点在互不干扰的情况下,使用最少的代码资源,使无线网络运行最优化.研究得到路的L(1,2)-可选择数的下界.假设可选择数的上界与下界相等,采用枚举法,对每个顶点的可选标号进行讨论,得到标号函数,验证了假设成立,最终得到路的L(1,2)-可选择数.

In order to solve the problem of code shortage in computer wireless network,a kind of wireless network is described by using paths.By studying the L(1,2)-choosability of paths,it is obtained that each computer station in wireless network has several available codes so that the computer station can use the least number of codes and optimize the operation of wireless network.The lower bounds on the L(1,2)-choosability of paths are obtained.Then,assuming that the upper bounds are equal to the corresponding lower bounds,enumeration method is used to discuss the optional label of each vertex,and the label function is defined to verify the hypothesis.Finally,the L(1,2)-choosability of paths is determined.