The mixed metric dimension of flower snarks and wheels

Danas, Milica Milivojević

doi:10.1515/math-2021-0065

Cited by 8 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some other classes of graphs also attracted attention of researchers, so among the literature it can be found Raza et al (2019) which in [13] gave the exact value of mixed metric dimension for three well-known classes of graphs: prism, antiprism and graph of convex polytope R n . And similarly, Milivojević Danas in [14], provided the exact results for two other important well-known classes of graphs: flower snarks and wheels.…”

Section: Literature Reviewmentioning

confidence: 90%

Some new general lower bounds for mixed metric dimension of graphs

Danas¹,

Kratica²,

Savić³

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

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

show abstract

Section: Literature Reviewmentioning

confidence: 90%