Computation of Metric Dimension of Certain Subdivided Convex Polytopes
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...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/3567485 |