点击次数：

论文类型：期刊论文

发表时间：2011-01-01

发表刊物：INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS

收录刊物：SCIE

卷号：88

期号：10

页面范围：2026-2034

ISSN号：0020-7160

关键字：channel assignment problem; distance-two labelling; multi-level distance labelling; radio number; radio labelling

摘要：Let G be a connected graph with diameter diam(G). The radio number for G, denoted by rn(G), is the smallest integer k such that there exists a function f : V(G) -> {0, 1, 2, ..., k} with the following satisfied for all vertices u and v : vertical bar f(u) - f(v)vertical bar >= diam(G) - d(G)(u,v) + 1, where d(G)(u,v) is the distance between u and v in G. In this paper, we determine the radio number of ladder graphs.