Nonlocal metric dimension of graphs

Abstract

Nonlocal metric dimension dim n(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 dim n(G) = 1 or with dim n(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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…