Abstract
Let $\Gamma=(V,E)$ be a connected graph. A vertex $i\in V$ recognizes two elements (vertices or edges) $j,k\in E \cap V$, if $d_{\Gamma}(i,j)\neq d_{\Gamma}(i,k)$. A set $S$ of vertices in a connected graph $\Gamma$ is a mixed metric generator for $\Gamma$ if every two distinct elements (vertices or edges)of $\Gamma$ are recognized by some vertex of $S$. The smallest cardinality of a mixed metric generator for $\Gamma$ is called the mixed metric dimension and is denoted by $\beta_{m}$. In this paper, the mixed metric dimension of generalized Petersen graph $P(n,2)$ is calculated. We established that generalized Petersen graph $P(n,2)$ has a mixed metric dimension equivalent to $4$ for $n\equiv 0,2(mod 4)$, and for $n\equiv 1,3(mod 4)$ the mixed metric dimension is $5$. Thus determining that each graph of the family of generalized Petersen graph $P(n,2)$ has a constant mixed metric dimension.
Highlights
The aim of robot navigation functionality is to attain the coveted position promptly whenever it is desired
Kelenc et al [14] introduced the concept of edge metric dimension, and this was further studied in Zubrilina [15], Peterin and Yero [16], and Zhu et al [17]
The recently introduced mixed metric dimension is calculated for P(n, 2)
Summary
The aim of robot navigation functionality is to attain the coveted position promptly whenever it is desired. Kelenc et al [14] introduced the concept of edge metric dimension, and this was further studied in Zubrilina [15], Peterin and Yero [16], and Zhu et al [17] This distance between an edge e = ab and a vertex c is given as follows d(e, c) = min{d(a, c), d(b, c)}. The following remark shows the structure of mixed metric dimension: Remark 1: [23] Suppose for some graph Ŵ we have 2 ≤ βm ≤ n This concept has attracted some attention, and it has been studied by Raza et al [24].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have