## Abstract

Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set of G and is denoted by dim(G). In this paper, Cycle, Path, Harary graphs and their rooted product as well as their connectivity are studied and their metric dimension is calculated. It is proven that metric dimension of some graphs is unbounded while the other graphs are constant, having three or four dimensions in certain cases.

Original language | English |
---|---|

Article number | 191 |

Journal | Mathematics |

Volume | 6 |

Issue number | 10 |

DOIs | |

Publication status | Published - Oct 8 2018 |

## Keywords

- Basis
- Cycle
- Harary graphs
- Metric dimension
- Path
- Resolving set
- Rooted product

## ASJC Scopus subject areas

- Computer Science (miscellaneous)
- Mathematics(all)
- Engineering (miscellaneous)