Abstract
A formula for computing the metric dimension of a simple graph, having no singleton twin, is given. A sufficient condition for a simple graph to have the exchange property, for resolving sets, is found. Some families of power graphs of finite groups, having this exchange property, are identified. The metric dimension of the power graph of a dihedral group is also computed.
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.