Abstract
For an ordered set of vertices and a vertex in a connected graph , the ordered -vector is called the (metric) representation of with respect to , where is the distance between the vertices and . The set is called a resolving set for if distinct vertices of have distinct representations with respect to . The minimum cardinality of a resolving set for is its metric dimension. In this paper, we study the metric dimension of the lexicographic product of graphs and , . First, we introduce a new parameter which is called adjacency metric dimension of a graph. Then, we obtain the metric dimension of in terms of the order of and the adjacency metric dimension of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.