The vertex-edge resolvability of some wheel-related graphs (Q2240172)

Summary: A vertex \(w\in V(H)\) distinguishes (or resolves) two elements (edges or vertices) \(a,z\in V(H)\cup E(H)\) if \(d(w, a)\neq d(w, z)\). A set \(W_m\) of vertices in a nontrivial connected graph \(H\) is said to be a mixed resolving set for \(H\) if every two different elements (edges and vertices) of \(H\) are distinguished by at least one vertex of \(W_m\). The mixed resolving set with minimum cardinality in \(H\) is called the mixed metric dimension (vertex-edge resolvability) of \(H\) and denoted by \(m\dim(H)\). The aim of this research is to determine the mixed metric dimension of some wheel graph subdivisions. We specifically analyze and compare the mixed metric, edge metric, and metric dimensions of the graphs obtained after the wheel graphs' spoke, cycle, and barycentric subdivisions. We also prove that the mixed resolving sets for some of these graphs are independent.