期刊名称：International Journal of Advances in Engineering and Management
电子版ISSN：2395-5252
出版年度：2021
卷号：3
期号：1
页码：123-129
DOI：10.35629/5252-0212855857
语种：English
出版社：IJAEM JOURNAL
摘要：The Channel Assignment Problem (CAP) is the problem of assigning channels (nonnegative integers) to the transmitters in an optimal way such that interference is avoided. The problem, often modelled as a labelling problem on the graph where vertices represent transmitters and edges indicate closeness of the transmitters. A radio kdistance labelling of graphs is a variation of CAP. For a simple connected graph G = (V G , E(G)) and a positive integer k, a radio k-distance labelling of G is a mapping f: V G → {0,1,2,… }such that f u − fv≥k+1−d(u,v) for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k -distance labelling f is the largest integer assigned to a vertex of G. The radio k -chromatic number of G is the minimum of spans of all possible radio k-labellings of G. In this article, we give a lowerbound for span of radio kdistance labelling of arbitrary graph G in terms some parameters related to metric closure of G.
关键词：Channel assignment;Metric closure Radio k-labelling;Radio k-chromatic number;Span
