Computation of Metric Dimension of Certain Subdivided Convex Polytopes

S. Imran, Z. Ali, N. Nigar, Syed Ajaz K. Kirmani, M. K. Siddiqui, S. A. Fufa and Gul Rahmat

Journal of Mathematics, 2022, vol. 2022, 1-9

Abstract: The distance dz1,z2 from vertex z1∈VG to z2∈VG is minimum length of z1,z2-path in a given connected graph G having E(G) and V(G) edges and vertices’/nodes’ sets, respectively. Suppose Z=z1,z2,z3,…,zm⊆VG is an order set and c∈VG, and the code of c with reference to Z is the m-tuple {d(c, z1), d(c, z2), d(c, z13), …, d(c, zk)}. Then, Z is named as the locating set or resolving set if each node of G has unique code. A locating set of least cardinality is described as a basis set for the graph G, and its cardinal number is referred to as metric dimension symbolized by dimG. Metric dimension of certain subdivided convex polytopes STn has been computed, and it is concluded that just four vertices are sufficient for unique coding of all nodes belonging to this family of convex polytopes.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/3567485.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/3567485.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:3567485

DOI: 10.1155/2022/3567485

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().