The mixed metric dimension of wheel-like graphs

Consider the graph G = (V, E). It is a connected graph. It is a simple graph too. A node w ∈ V, then we call vertex, determined two elements of graph. There are vertices and edges of graphs. Any two vertices x, y ∈ E ∪ V if d(w, x) ≠ d(w, y), which d(w, x) and d(w, y) is the mixed distance of the element w (vertices or edges) in graph G. A set of vertices in a graph G is represented by the symbol R_m that defines a mixed metric generator for G, if the elements of vertices or edges are stipulated by several vertex set of R_m. There's a chance that some mixed metric generators have varied cardinality. We choose one whose the minimum cardinality and it is called the mixed metric dimension of graph G, denoted by dim_m(G). This research examines the mixed metric dimension of gear G_n, helm H_n, sunflower SF_n, and friendship graph Fr_n. We call these graphs by wheel-like graphs.