两类特殊图的L(2,1)-标号  

THE L(2,1)-LABELING NUMBER OF TWO SPECIAL GRAPHS

作　　者：红霞[1] 敖国艳 高峰 余天虎 Hong Xia;Ao Guoyan;Gao Feng;Yu Tianhu(Department of mathematics,Luoyang Normal University,Luoyang 471022;College of Mathematics and Statistics,Hulunbuir University,Hailaer 021008)

机构地区：[1]洛阳师范学院数学科学学院,洛阳471022 [2]呼伦贝尔学院数学与统计学院,海拉尔021008

出　　处：《高等学校计算数学学报》2020年第1期13-21,共9页Numerical Mathematics A Journal of Chinese Universities

基　　金：国家自然科学基金(No.11701257);河南省教育厅高校重点项目(No.18A110025、No.18A110026).

摘　　要：图的L(2,1)-标号问题源于Hale[2]的无线电频道分配问题,该问题引起了广大学者们的兴趣.随着通信技术的迅速发展,人们需要考虑的问题是如何对无线电频率进行合理分配.在进行合理分配时,为避免传输的信号发生干扰,需要考虑邻近点发射的信号的频率必须一定的间隔,距离较近的站点发射的信号频率必须为不同.An L(2,1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that adjacent vertices receive numbers differed by at least 2,and vertices at distance 2 are assigned distinct numbers.The L(2,1)-labeling number λ(G) of G is the smallest number over the spans max{f(v):v∈V(G)}of all L(2,1)-labelings of G.In this paper,we are give a exact labeling number of two special graphs n·F1.m and n·W1.m by exhaustived method and classified discussion.

关 键 词：无线电频率 频道分配问题 信号频率 信号发生 合理分配 邻近点 

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