#### Filter Results:

#### Publication Year

2008

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.
- J. Discrete Algorithms
- 2008

A minimum metric basis is a minimum set W of vertices of a graph G(V, E) such that for every pair of vertices u and v of G, there exists a vertex w ∈ W with the condition that the length of a shortest path from u to w is different from the length of a shortest path from v to w. The honeycomb and hexagonal networks are popular mesh-derived parallel… (More)

- Bharati Rajan, K. T. Sonia, Chris Monica M.
- Mathematics in Computer Science
- 2011

- Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.
- Ars Comb.
- 2011

Let M = {v 1 , v 2 ... v ℓ } be an ordered set of vertices in a graph G. Then is called the M-location of a vertex u of G. The set M is called a locating set if the vertices of G have distinct M-locations. A minimum locating set is a set M with minimum cardinality. The cardinality of a minimum locating set of G is called Location Number L(G). This concept… (More)

- Bharati Rajan, Indra Rajasingh, P. Venugopal, Chris Monica M.
- Ars Comb.
- 2014

- ‹
- 1
- ›