#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1996

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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… (More)

- Daphne Der-Fen Liu, Melanie Xie
- Ars Comb.
- 2009

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… (More)

11 for parameters a, b, and c are sought which minimize a cost function of the form: 1 p a 2 + b 2 N X i=1 jax i + by i + cj : (4) Note that the cost carried by each point is the L1 distance from the… (More)

- ‹
- 1
- ›