#### Filter Results:

#### Publication Year

2004

2009

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Melanie Xie
- 2004

Let G be a connected graph with diameter d. For any two vertices u and v, let dG(u, v) denote the distance between u and v. A radio labelling for G is a function f that assigns to each vertex a non-negative integer (label) such that the inequality |f (u) − f (v)| ≥ d − dG(u, v) + 1 holds for any two vertices u and v. The span of f is the difference of the… (More)

Let G be a connected graph. For any two vertices u and v, let d(u, v) denote the distance between u and v in G. The maximum distance between any pair of vertices is called the diameter of G and denoted by diam(G). A radio-labeling (or multi-level distance labeling) with span k for G is a function f that assigns to each vertex with a label from the set {0,… (More)

- ‹
- 1
- ›