E-resources
Peer reviewed
-
Wang, Haoli; Xu, Xirong; Yang, Yuansheng; Zhang, Baosheng; Luo, Meiqin; Wang, Guoqing
International journal of computer mathematics, 07/2011, Volume: 88, Issue: 10Journal Article
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:|f(u)−f(v)|≥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.
