Abstract
For an ordered set W = {w 1, w 2,..., w k} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the k-vector r(v|W) = (d(v, w 1), d(v, w 2),... d(v, w k)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct representations with respect to W. A resolving set for G containing a minimum number of vertices is a basis for G. The dimension dim(G) is the number of vertices in a basis for G. A resolving set W of G is connected if the subgraph 〈W〉 induced by W is a nontrivial connected subgraph of G. The minimum cardinality of a connected resolving set in a graph G is its connected resolving number cr(G). Thus 1 ≤ dim(G) ≤ cr(G) ≤ n−1 for every connected graph G of order n ≥ 3. The connected resolving numbers of some well-known graphs are determined. It is shown that if G is a connected graph of order n ≥ 3, then cr(G) = n−1 if and only if G = K n or G = K 1,n−1. It is also shown that for positive integers a, b with a ≤ b, there exists a connected graph G with dim(G) = a and cr(G) = b if and only if \(\left( {a,b} \right) \notin \left\{ {\left( {1,k} \right):k = 1\;{\text{or}}\;k \geqslant 3} \right\}\) Several other realization results are present. The connected resolving numbers of the Cartesian products G × K 2 for connected graphs G are studied.
Similar content being viewed by others
References
P. Buczkowski, G. Chartrand, C. Poisson and P. Zhang: On k-dimensional graphs and their bases. Period. Math. Hungar. 46 (2003), 25–36.
G. Chartrand, L. Eroh, M. Johnson and O. Oellermann: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105 (2000), 99–113.
G. Chartrand and L. Lesniak: Graphs & Digraphs. Third edition. Chapman & Hall, New York, 1996.
G. Chartrand, C. Poisson and P. Zhang: Resolvability and the upper dimension of graphs. Inter. J. Comput. Math. Appl. 39 (2000), 19–28.
G. Chartrand, M. Raines and P. Zhang: The directed distance dimension of oriented graphs. Math. Bohem. 125 (2000), 155–168.
M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York,1979.
F. Harary and R. A. Melter: On the metric dimension of a graph. Ars Combin. 2 (1976), 191–195.
M. A. Johnson: Browsable structure-activity datasets. Submitted.
P. J. Slater: Leaves of trees. Congr. Numer. 14 (1975), 549–559.
P. J. Slater: Dominating and reference sets in graphs. J. Math. Phys. Sci. 22 (1988), 445–455.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Saenpholphat, V., Zhang, P. Connected Resolvability of Graphs. Czech Math J 53, 827–840 (2003). https://doi.org/10.1023/B:CMAJ.0000024524.43125.cd
Issue Date:
DOI: https://doi.org/10.1023/B:CMAJ.0000024524.43125.cd