%0 Journal Article
%T The metric dimension and girth of graphs
%J Bulletin of the Iranian Mathematical Society
%I Springer and the Iranian Mathematical Society (IMS)
%Z 1017-060X
%A Jannesari, M.
%D 2015
%\ 06/01/2015
%V 41
%N 3
%P 633-638
%! The metric dimension and girth of graphs
%K Resolving set
%K metric dimension
%K girth
%R
%X A set $Wsubseteq V(G)$ is called a resolving set for $G$,
if for each two distinct vertices $u,vin V(G)$ there exists $win W$
such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance
between the vertices $x$ and $y$. The minimum cardinality of a
resolving set for $G$ is called the metric dimension of $G$, and
denoted by $dim(G)$. In this paper, it is proved that in a
connected graph $G$ of order $n$ which has a cycle, $dim(G)leq n-g(G)+2$,
where $g(G)$ is the length of the shortest cycle in $G$, and the
equality holds if and only if $G$ is a cycle, a complete graph or a
complete bipartite graph $K_{s,t}$, $ s,tgeq 2$.
%U http://bims.iranjournals.ir/article_638_d88f00c535acfb7583ac4db47a80194e.pdf