Loading...
On the partition dimension of a class of circulant graphs
Grigorious, Cyriac Stephen, Sudeep Rajan, Bharati Miller, Mirka William, Albert
Grigorious, Cyriac
Stephen, Sudeep
Rajan, Bharati
Miller, Mirka
William, Albert
Abstract
For a vertex v of a connected graph G(V , E) and a subset S of V , the distance between a vertex v and S is defined by d(v, S) = min{d(v, x): x ∈ S}. For an ordered k-partition π = {S1, S2 . . . S k } of V , the partition representation of v with respect to π is the k-vector r(v|π ) = (d(v, S1), d(v, S2) . . . d(v, S k)). The k-partition π is a resolving partition if the k-vectors r(v|π ), v ∈ V (G) are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. Salman et al. in their paper which appeared in Acta Mathematica Sinica, English Series proved that partition dimension of a class of circulant graph G(n, ±{1, 2}), for all even n 6 is four. In this paper we prove that it is three.
Keywords
Partition dimension, Metric dimension, Circulant graphs, Interconnection networks
Date
2014
Type
Journal article
Journal
Book
Volume
114
Issue
7
Page Range
353-356
Article Number
ACU Department
School of Arts and Humanities
Faculty of Education and Arts
Faculty of Education and Arts
Collections
Relation URI
Event URL
Open Access Status
License
All rights reserved
File Access
Controlled
Notes
© 2014 Elsevier B.V. All rights reserved