On the partition dimension of a class of circulant graphs

DOI10.1016/J.IPL.2014.02.005MaRDI QIDQ2446592zbMATH OpenOpenAlexFDO

Authors Cyriac Grigorious, Sudeep Stephen, Mirka Miller, Albert William, Bharati Rajan

Publication date 17 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.05239

circulant graphs interconnection networks metric dimension partition dimension

Distance in graphs (05C12) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Abstract: For a vertex

v

of a connected graph

G (V, E)

and a subset

S

of

V

, the distance between

v

and

S

is defined by

d (v, S) = m i n d (v, x) : x i n S .

For an ordered emph{k}-partition

P i = S_{1}, S_{2} l d o t s S_{k}

of

V

, the representation of

v

with respect to

P i

is the

k

-vector

r (v | P i) = (d (v, S_{1}), d (v, S_{2}) l d o t s d (v, S_{k})) .

The

k

-partition

P i

is a resolving partition if the

k

-vectors

r (v | P i)

,

v i n V

are distinct. The minimum

k

for which there is a resolving

k

-partition of

V

is the emph{partition dimension} of

G

. Salman et al.{ mcite{SaJaCh12}} claimed that emph{partition dimension} of a class of circulant graphs

C (n, p m 1, 2)

, for all even

n g e q 6

is 4 and it is 3 when

n

is odd. In this paper we obtain the partition dimension of circulant graphs

G = C (n, p m 1, 2 l d o t s j), 1 l e q j < l f l o o r f r a c n 2 f l o o r

,

n g e q (j + k) (j + 1)

,

n e q u i v k m o d (2 j)

and

k

and

2 j

are co-primes as, �egin{eqnarray*} pd(G) &=& j+1 when j is even and all k=2m-1, 1 leq m leq j \ pd(G)&=& j+1 when j is odd and all k=2m, 1 leq m leq j. end{eqnarray*}

Recommendations

Cites work

Cited in

(15)

This page was built for publication: On the partition dimension of a class of circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446592)