Abstract
Let M = {v1, v2 ... v'n} be an ordered set of vertices in a graph G. Then (d(u, v1), d(u, V2) ... d(u, vn)) is called the M-coordinates of a vertex u of G. The set M is called a metric basis if the vertices of G have distinct M-coordinates. A minimum metric basis is a set M with minimum cardinality. The cardinality of a minimum metric basis of G is called minimum metric dimension. This concept has wide applications in motion planning and in the field of robotics. In this paper we provide bounds for minimum metric dimension of certain class of enhanced hypercube networks.
| Original language | English |
|---|---|
| Pages (from-to) | 5-15 |
| Number of pages | 11 |
| Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
| Volume | 67 |
| State | Published - Nov 2008 |
Keywords
- Hypercube networks
- Image
- Metric basis
- Metric dimension
- Robotics
Fingerprint
Dive into the research topics of 'Metric dimension of enhanced hypercube networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver