Learn 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
- ›