Abstract
Given a simple and connected graph , and a positive integer , a set is said to be a -metric generator for , if for any pair of different vertices , there exist at least vertices such that , for every , where denotes the distance between and . The minimum cardinality of a -metric generator is the -metric dimension of . A set is a -adjacency generator for if any two different vertices satisfy , where is the symmetric difference of the neighborhoods of and . The minimum cardinality of any -adjacency generator is the -adjacency dimension of . In this article we obtain tight bounds and closed formulae for the -metric dimension of the lexicographic product of graphs in terms of the -adjacency dimension of the factor graphs.
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.