Abstract
A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, υ ∈ V (G) there is a vertex w ∈ W such that d(u,w) ≠ d(υ,w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number mins∈S d(u, s). A k-partition Π = {S 1, S 2, …, S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, S i ) ≠ d(v, S i ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set ℤ n , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i − j (mod n) ∈ C, where C ∈ ℤ n has the property that C = −C and 0 ∉ C. The circulant graph is denoted by X n,Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs X n,3 with connection set \(C = \left\{ {1,\tfrac{n} {2},n - 1} \right\}\) and prove that dim(X n,3) is independent of choice of n by showing that
We also study the partition dimension of a family of circulant graphs X n,4 with connection set C = {±1,±2} and prove that pd(X n,4) is independent of choice of n and show that pd(X 5,4) = 5 and
.
Similar content being viewed by others
References
Buczkowski, P. S., Chartrand, G., Poisson, C., et al.: On k-dimensional graphs and their bases. Periodica Math. Hung., 46(1), 9–15 (2003)
Harary, F., Melter, R. A.: On the metric dimension of a graph. Ars Combin., 2, 191–195 (1976)
Slater, P. J.: Leaves of trees. Congr. Numer., 14, 549–559 (1975)
Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Disc. Appl. Math., 70, 217–229 (1996)
Chartrand, G., Eroh, L., Johnson, M. A., et al.: Resolvability in graphs and the metric dimension of a graph. Disc. Appl. Math., 105, 99–113 (2000)
Melter, R. A., Tomescu, I.: Metric bases in digital geometry. Computer Vision, Graphics, and Image Processing, 25, 113–121 (1984)
Garey, M. R., Johnson, D. S.: Computers and Intactability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979
Caceres, J., Hernando, C., Mora, M., et al.: On the metric dimension of cartesian product of graphs. SIAM J. Disc. Math., 21(2), 423–441 (2007)
Harinath, K. S., Shanmukha, B., Sooryanarayana, B.: Metric dimension of wheels. Far East J. Appl. Math., 8(3), 217–229 (2002)
Imran, M., Baig, A. Q., Shafiq, M. K.: On the metric dimension of generalized Petersen graphs P(n, 3). Util. Math., in press
Javaid, I., Rahim, M. T., Ali, K.: Families of regular graphs with constant metric dimension. Util. Math., 75, 21–33 (2008)
Manuel, P., Bharati, R., Rajasingh, I., et al.: Landmarks in torus networks. IEEE Transactions on Parallel and Distributed Systems, 9(2), 263–271 (2006)
Chartrand, G., Salehi, E., Zhang, P.: The partition dimension of a graph. Aequationes Math., 59, 45–54 (2000)
Feng, R. Q., Kwak, J. H.: Circulant double coverings of a circulant graph of valency five. Acta Mathematica Sinica, English Series, 23(1), 23–28 (2007)
Morris, J.: Automorphism groups of circulant graphs — A survey. In: Grapth Theory, Trends in Math., 2006, 311–325
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the Higher Education Commission of Pakistan (Grant No. 17-5-3(Ps3-257) HEC/Sch/2006)
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Salman, M., Javaid, I. & Chaudhry, M.A. Resolvability in circulant graphs. Acta. Math. Sin.-English Ser. 28, 1851–1864 (2012). https://doi.org/10.1007/s10114-012-0417-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-012-0417-4