Name
Abstract | ||
|---|---|---|
A radio labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G, with x is an element of V(G) labeled c(x), such thatd(u, v) + \c(u) - c(v)\ greater than or equal to 1 + diam Gfor every two distinct vertices u, v of G, where diam G is the diameter of G. The radio number rn(c) of a radio labeling c of G is the maximum label assigned to a vertex of G. The radio number rn(G) of G is min{rn(c)} over all radio labelings c of G. Radio numbers of cycles are discussed and upper and lower bounds are presented. |
Year | Venue | Keywords |
|---|---|---|
2002 | ARS COMBINATORIA | radio labeling, radio number |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Mathematics | Journal | 65 |
ISSN | Citations | PageRank |
0381-7032 | 16 | 1.35 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ping Zhang | 1 | 292 | 47.70 |