Article thumbnail

On minimum metric dimension of honeycomb networks

By Paul Manuel, Rajan Bharati, Indra Rajasingh and Chris Monica M

Abstract

AbstractA 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 architectures. Using the duality of these networks we determine minimum metric bases for hexagonal and honeycomb networks

Publisher: Elsevier B.V.
Year: 2008
DOI identifier: 10.1016/j.jda.2006.09.002
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://s3-eu-west-1.amazonaws... (external link)
  • https://s3.amazonaws.com/prod-... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.