@article {
author = {Jannesari, Mohsen},
title = {Unicyclic graphs with non-isolated resolving number $2$},
journal = {Transactions on Combinatorics},
volume = {12},
number = {2},
pages = {73-78},
year = {2023},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2022.129790.1880},
abstract = {Let $G$ be a connected graph and $W=\{w_1, w_2,\ldots,w_k\}$ be an ordered subset of vertices of $G$. For any vertex $v$ of $G$, the ordered $k$-vector $$r(v|W)=(d(v,w_1), d(v,w_2),\ldots,d(v,w_k))$$ is called the metric representation of $v$ with respect to $W$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. A set $W$ is called a resolving set for $G$ if distinct vertices of $G$ have distinct metric representations with respect to $W$. The minimum cardinality of a resolving set for $G$ is its metric dimension denoted by $\dim(G)$. A resolving set $W$ is called a non-isolated resolving set for $G$ if the induced subgraph $\langle W\rangle$ of $G$ has no isolated vertices. The minimum cardinality of a non-isolated resolving set for $G$ is called the non-isolated resolving number of $G$ and denoted by $nr(G)$. The aim of this paper is to find properties of unicyclic graphs that have non-isolated resolving number $2$ and then to characterize all these graphs.},
keywords = {non-isolated resolving sets,Unicyclic graphs,Metric dimension},
url = {https://toc.ui.ac.ir/article_26496.html},
eprint = {https://toc.ui.ac.ir/article_26496_8db320090b312f97cc28e3165deb95d9.pdf}
}