Mixed metric dimension of some graphs

Kairui Nie and Kexiang Xu

Applied Mathematics and Computation, 2023, vol. 442, issue C

Abstract: A vertex gv in a connected graph G is said to distinguish two distinct elements p,q∈V(G)⋃E(G) if dG(p,gv)≠dG(q,gv). A subset W⊆V(G) is a mixed metric generator of G if every two distinct elements from V(G)⋃E(G) are distinguished by W. The mixed metric dimension of G, denoted by βm(G), is the minimum cardinality of mixed metric generators in it. In this work, we first answer the problem of characterizing graphs G which achieve βm(G)=n−g(G)+3 in [Appl. Math. Comput. 314 (2017) 429–438] where g(G) is the girth of G, and then determine bounds on the mixed metric dimension of Cartesian product G□H which resolves two open problems in [Discrete Math. 341 (2018) 2083–2088] as a natural corollary. In addition, we provide two closed formulae for βm(T□Pn) in terms of βm(T) which generalize the result on βm(Ps□Pn) in [Appl. Math. Comput. 314 (2017) 429–438].

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

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322008050
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:442:y:2023:i:c:s0096300322008050

DOI: 10.1016/j.amc.2022.127737

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 ().