{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T15:29:05Z","timestamp":1772033345065,"version":"3.50.1"},"reference-count":22,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T00:00:00Z","timestamp":1545955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>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     m d ( G )     of a graph G is the smallest number k for which G contains a vertex set W, such that     | W | = k     and every pair of vertices of G possess different distances to at least one vertex in W. In this paper, we demonstrate that     m d (  H D N 1  ( n ) ) = 4     for     n \u2265 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.<\/jats:p>","DOI":"10.3390\/s19010094","type":"journal-article","created":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T11:52:42Z","timestamp":1545997962000},"page":"94","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["On Metric Dimension in Some Hex Derived Networks"],"prefix":"10.3390","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0764-4135","authenticated-orcid":false,"given":"Zehui","family":"Shao","sequence":"first","affiliation":[{"name":"Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China"}]},{"given":"Pu","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China"}]},{"given":"Enqiang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China"}]},{"given":"Lanxiang","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Mathematics and Informatics, Fujian Normal University, Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Network &amp; Information Security Industry Technology Development Base, Fuzhou 350117, China"}]}],"member":"1968","published-online":{"date-parts":[[2018,12,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","article-title":"Landmarks in graphs","volume":"70","author":"Khuller","year":"1996","journal-title":"Discret. Appl. Math."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.21136\/MB.2003.134003","article-title":"The independent resolving number of a graph","volume":"128","author":"Chartrand","year":"2003","journal-title":"Math. Bohem."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.21136\/MB.2010.140702","article-title":"The local metric dimension of a graph","volume":"135","author":"Okamoto","year":"2010","journal-title":"Math. Bohem."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.1030.0070","article-title":"On metric generators of graph","volume":"29","author":"Tannier","year":"2004","journal-title":"Math. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.dam.2006.06.009","article-title":"The strong metric dimension of graphs and digraphs","volume":"155","author":"Oellermann","year":"2007","journal-title":"Discret. Appl. Math."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.ins.2015.08.048","article-title":"k-metric antidimension: A privacy measure for social graphs","volume":"328","author":"Yero","year":"2016","journal-title":"Inform. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.amc.2017.07.027","article-title":"Mixed metric dimension of graphs","volume":"314","author":"Kelenc","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"ref_8","first-page":"191","article-title":"On the metric dimension of a graph","volume":"2","author":"Harary","year":"1976","journal-title":"Ars Comb."},{"key":"ref_9","first-page":"549","article-title":"Leaves of trees","volume":"14","author":"Slater","year":"1975","journal-title":"Congr. Numer."},{"key":"ref_10","unstructured":"Garey, M.R., and Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","article-title":"Network Discovery and Verification","volume":"24","author":"Beerliova","year":"2006","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4531958","DOI":"10.1155\/2018\/4531958","article-title":"The metric dimension of some generalized Petersen graphs","volume":"2018","author":"Shao","year":"2018","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"ref_13","unstructured":"Raicu, I., and Palur, S. Understanding torus network performance through simulations. Proceedings of the Greater Chicago Area System Research Workshop, Available online: http:\/\/datasys.cs.iit.edu\/reports\/2014_GCASR14_paper-torus.pdf."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0021-9800(69)80116-X","article-title":"A theorem on Tait colorings with an application to the generalized Petersen graph","volume":"6","author":"Watkins","year":"1969","journal-title":"J. Comb. Theory"},{"key":"ref_15","first-page":"21","article-title":"Families of regular graphs with constant metric dimension","volume":"75","author":"Javaid","year":"2007","journal-title":"Util. Math."},{"key":"ref_16","first-page":"113","article-title":"On metric dimension of generalized Petersen graphs P(n, 3)","volume":"117","author":"Imran","year":"2014","journal-title":"Ars Comb."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1007\/s10114-014-2372-8","article-title":"On the constant metric dimension of generalized Petersen gpraphs P(n, 4)","volume":"30","author":"Naz","year":"2014","journal-title":"Acta Math. Sin."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.jda.2006.09.002","article-title":"On minimum metric dimension of honeycomb networks","volume":"6","author":"Manuel","year":"2008","journal-title":"J. Discret. Algorithm"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/12.46277","article-title":"Addressing, routing, and broadcasting in hexagonal mesh multiprocessors","volume":"39","author":"Chen","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/71.629486","article-title":"Honeycomb networks: Topological properties and communication algorithms","volume":"8","author":"Stojmenovic","year":"1997","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/71.899940","article-title":"A unified formulation of honeycomb and diamond networks","volume":"12","author":"Parhami","year":"2001","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jda.2013.09.002","article-title":"On the metric dimension of HDN","volume":"26","author":"Xu","year":"2014","journal-title":"J. Discret. Algorithm"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/1\/94\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:36:29Z","timestamp":1760196989000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/1\/94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,28]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1]]}},"alternative-id":["s19010094"],"URL":"https:\/\/doi.org\/10.3390\/s19010094","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,28]]}}}