图的L(2,1)-标号与移动通讯频率分配问题

On the L(2,1)-labeling problem on graphs and the problem of moving communication frequency assignment

移动通讯频率分配问题可以转化为图的L(2,1)-标号问题。平面格子图、三角格子图在移动通讯上起着重要的作用。该文通过对平面格子图、三角格子图的结构进行分析来研究这两类图类的L(2,1)-标号问题。首先研究了参考文献[1]中的一个错误结果,并精确刻划了上述两类图的L(2,1)-标号的边跨距及λ-L(2,1)-标号的边跨距,从而全面地解决了平面格子图、三角格子图上的移动通讯频率分配问题。

The moving communication frequency assignment problem can be transformed into an L（2, 1 ） - labeling problem on a graph. The square lattice graphs and triangular lattice graphs play an important role in the moving communication frequency assignment problem. This paper firstly corrects a wrong result given by refernece [ 1 ], then gives the edge spans of L（2,1 ） - labeling and lambda - L（2,1 ） - labeling of the above two kinds of graphs, so the moving communication frequency assignment problem is completely solved.