Mixed metric dimension of graphs

Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko and Ismael G. Yero

Applied Mathematics and Computation, 2017, vol. 314, issue C, 429-438

Abstract: Let G=(V,E) be a connected graph. A vertex w ∈ V distinguishes two elements (vertices or edges) x, y ∈ E ∪ V if dG(w, x) ≠ dG(w, y). A set S of vertices in a connected graph G is a mixed metric generator for G if every two distinct elements (vertices or edges) of G are distinguished by some vertex of S. The smallest cardinality of a mixed metric generator for G is called the mixed metric dimension and is denoted by dimm(G). In this paper we consider the structure of mixed metric generators and characterize graphs for which the mixed metric dimension equals the trivial lower and upper bounds. We also give results about the mixed metric dimension of some families of graphs and present an upper bound with respect to the girth of a graph. Finally, we prove that the problem of determining the mixed metric dimension of a graph is NP-hard in the general case.

Keywords: Mixed metric dimension; Edge metric dimension; Metric dimension (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317304782
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:314:y:2017:i:c:p:429-438

DOI: 10.1016/j.amc.2017.07.027

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().