Abstract
Nonlocal metric dimension $$\text {dim}_{\textrm{n}\ell } (G)$$ of a graph G is introduced as the cardinality of a smallest nonlocal resolving set, that is, a set of vertices which resolves each pair of non-adjacent vertices of G. Graphs G with $$\text {dim}_{\textrm{n}\ell }(G) = 1$$ or with $$\text {dim}_{\textrm{n}\ell }(G) = n(G)-2$$ are characterized. The nonlocal metric dimension is determined for block graphs, for corona products, and for wheels. Two upper bounds on the nonlocal metric dimension are proved. An embedding of an arbitrary graph into a supergraph with a small nonlocal metric dimension and small diameter is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have