Chris Monica M.

Learn More
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)
Let M = {v1, v2 ... vl} be an ordered set of vertices in a graph G. Then (d(u, v1), d(u, v2) ... d(u, vl)) 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(More)
  • 1