@Article{cmes.2023.025162,
AUTHOR = {Xiujun Zhang, Muhammad Salman, Anam Rani, Rashna Tanveer, Usman Ali, Zehui Shao},
TITLE = {Metric Identification of Vertices in Polygonal Cacti},
JOURNAL = {Computer Modeling in Engineering \& Sciences},
VOLUME = {136},
YEAR = {2023},
NUMBER = {1},
PAGES = {883--899},
URL = {http://www.techscience.com/CMES/v136n1/51222},
ISSN = {1526-1506},
ABSTRACT = {The distance between two vertices <i>u</i> and <i>v</i> in a connected graph <i>G</i> is the number of edges lying in a shortest path
(geodesic) between them. A vertex <i>x</i> of <i>G</i> performs the metric identification for a pair (<i>u</i>, <i>v</i>) of vertices in <i>G</i> if
and only if the equality between the distances of <i>u</i> and <i>v</i> with <i>x</i> implies that <i>u</i> = <i>v</i> (That is, the distance between
<i>u</i> and <i>x</i> is different from the distance between <i>v</i> and <i>x</i>). The minimum number of vertices performing the metric
identification for every pair of vertices in <i>G</i> defines the metric dimension of <i>G</i>. In this paper, we perform the metric
identification of vertices in two types of polygonal cacti: chain polygonal cactus and star polygonal cactus.},
DOI = {10.32604/cmes.2023.025162}
}