Let G = (V, E) be a connected simple graph. The distance d(u, v) between vertices u and v from V is the number of edges in the shortest u − v path. If e = uv ∈ E is an edge in G than distance d(w, e) where w is some vertex in G is defined as d(w, e) = min (d(w, u), d(w, v)). Now we can say that vertex w ∈ V resolves two elements x, y ∈ V ∪ E if d(w, x) = d(w, y). The mixed resolving set is a set of vertices S, S ⊆ V if and only if any two elements of E ∪ V are resolved by some element of S. A minimal resolving set related to inclusion is called mixed resolving basis, and its cardinality is called the mixed metric dimension of a graph G.This graph invariant is recently introduced and it is of interest to find its general properties and determine its values for various classes of graphs. Since the problem of finding mixed metric dimension is a minimization problem, of interest is also to find lower bounds of good quality. This paper will introduce three new general lower bounds. The exact values of mixed metric dimension for torus graph is determined using one of these lower bounds. Finally, the comparison between new lower bounds and those known in the literature will

New graph invariant, which is called a mixed metric dimension, has been recently introduced. In this paper, exact results of the mixed metric dimension on two special classes of graphs are found: flower snarks J n {J}_{n} and wheels W n {W}_{n} . It is proved that the mixed metric dimension for J 5 {J}_{5} is equal to 5, while for higher dimensions it is constant and equal to 4. For W n {W}_{n} , the mixed metric dimension is not constant, but it is equal to n n when n ≥ 4 n\ge 4 , while it is equal to 4, for n = 3 n=3 .

New graph invariant, which is called mixed metric dimension, has been recently introduced. In this paper, exact results of mixed metric dimension on two special classes of graphs are found: flower snarks J n and wheels W n . It is proved that mixed metric dimension for J 5 is equal to 5, while for higher dimensions it is constant and equal to 4. For W n , its mixed metric dimension is not constant, but it is equal to n when n ≥ 4, while it is equal to 4, for n = 3.

No abstract

In this paper extremal values of the difference between several graph invariants related to the metric dimension are studied: mixed metric dimension, edge metric dimension and strong metric dimension. These non-trivial extremal values are computed over all connected graphs of given order. To obtain such extremal values several techniques are developed. They use functions related to metric dimension graph invariants to obtain lower and/or upper bounds on these extremal values and exact computations when restricting to some specific families of graphs.