正则图的距离标号数的上界

Upper Bounds for L(h_1,h_2)-Labeling Numbers of Regular Graphs

图的距离标号问题是近30年来研究比较活跃的一个标号分支,最初源于对无线网络中频率分配问题的一种抽象描述,同时它也是图论中经典图着色理论的自然推广,具有重要的理论意义与应用价值.文章主要研究k-正则图的L(h_1,h_2)标号数,通过利用Lovsz局部引理,给出了k-正则图的距离标号数的上界.

The distance labeling of a graph is a very active research field in the past 30 years,which originally came from an abstract description of the channel assignment problem in a radio network,and also is a generalized coloring problem of graphs,with a certain theoretical research value and practical value.In this article,an upper bound was given for L（h1,h2）-labeling numbers of regular graphs by applying Lovász local lemma.