Power Graph and Exchange Property for Resolving Sets
Combinatorics
2016-04-01 v1
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.
Keywords
Cite
@article{arxiv.1603.09518,
title = {Power Graph and Exchange Property for Resolving Sets},
author = {Usman Ali and Ghulam Abbas and Syed Ahtisham Bokhary},
journal= {arXiv preprint arXiv:1603.09518},
year = {2016}
}