Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2011-01-01

Journal: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS

Included Journals: SCIE

Volume: 88

Issue: 10

Page Number: 2026-2034

ISSN: 0020-7160

Key Words: channel assignment problem; distance-two labelling; multi-level distance labelling; radio number; radio labelling

Abstract: 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.