Total resolving number of subdivision and total graphs N. Shunmugapriya and J. Paulraj Joseph
Abstract: Let $G = (V, E)$ be a simple connected graph. An ordered subset $W$ of $V$ is said to be a \textit{resolving set} of $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $W.$ The minimum cardinality of a resolving set is called the \textit{resolving number} of $G$ and is denoted by $r(G).$ As an extension, the \textit{total resolving number} was introduced in \cite{F} as the minimum cardinality taken over all resolving sets in which $\left\langle W \right\rangle$ has no isolates and it is denoted by $tr(G).$ In this paper, we obtain the bounds on the total resolving number of subdivision graphs and total graphs. Also, we characterize the extremal graphs.
Keywords: Resolving number, total resolving number, subdivision graph and total graph.
How to cite this article:
N. Shunmugapriya and J. Paulraj Joseph, Total resolving number of subdivision and total graphs, International Journal of Advances in Mathematics, Volume 2018, Number 3, Pages 34-40, 2018.