Name
Abstract | ||
|---|---|---|
The concept of a metric dimension was proposed to model robot navigation where the places of navigating agents can change among nodes. The metric dimension md (G) of a graph G is the smallest number k for which G contains a vertex set W, such that vertical bar W vertical bar = k and every pair of vertices of G possess different distances to at least one vertex in W. In this paper, we demonstrate that md (HDN1 (n)) = 4 for n >= 2. This indicates that in these types of hex derived sensor networks, the least number of nodes needed for locating any other node is four. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.3390/s19010094 | SENSORS |
Keywords | Field | DocType |
robot navigation,sensor network,metric dimension,metric basis | Discrete mathematics,Graph,Vertex (geometry),Electronic engineering,Engineering,Robot,Wireless sensor network,Metric dimension | Journal |
Volume | Issue | ISSN |
19 | 1 | 1424-8220 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zehui Shao | 1 | 119 | 30.98 |
| Pu Wu | 2 | 8 | 2.22 |
| Enqiang Zhu | 3 | 25 | 11.99 |
| Lanxiang Chen | 4 | 12 | 4.66 |