Professional Documents
Culture Documents
On Minimum Metric Dimension of Circulant Networks
On Minimum Metric Dimension of Circulant Networks
ABSTRACT
Let M = {v1 , v 2 ,..., vn } be an ordered set of vertices in
a graph G. Then
1. INTRODUCTION
Major issues involved in the design
of interconnection networks are quick
*This research is supported by The
Major Project-No.F.8-5-2004(SR) of University
Grants Commission, India.
Journal of Computer and Mathematical Sciences Vol. 1 Issue 2, 31 March, 2010 Pages (103-273)
156
Journal of Computer and Mathematical Sciences Vol. 1 Issue 2, 31 March, 2010 Pages (103-273)
157
s{1, 2 j}}.
The graph in Figure 1 is the
circulant graph G(8; {1, 2}). It is also
clear that G(n;1) is an undirected
cycle C n and G(n; {1, 2 n/2}) is
a complete graph K n . We observe
e
that C n = G(n, 1) is a subgraph of
G(n; {1, 2 j}) for every j, 1 < j
n/2.
Journal of Computer and Mathematical Sciences Vol. 1 Issue 2, 31 March, 2010 Pages (103-273)
158
3
4
complete digraph K n .
Theoretical properties of circulant
graphs have been studied extensively
and are surveyed in2. A circulant graph
Journal of Computer and Mathematical Sciences Vol. 1 Issue 2, 31 March, 2010 Pages (103-273)
D( x) 1 if n = 4l + 2
2.
D( x) 2 if n = 4l + 3
3.
D( x) 3 if n = 4l
4.
D( x) 4 if n = 4l + 1.
159
(n 1) / 2 .
Proposition 2: Let t =
Then
{a *, at , bt }
{a , a , b , b }
D( a) t 1 t t 1 t
{a *}
{a t , bt }
if
if
if
if
n 4l
n 4l 1
n 4l 2
n 4l 3
Journal of Computer and Mathematical Sciences Vol. 1 Issue 2, 31 March, 2010 Pages (103-273)
160
b2 i 1 , b 2i , 1 i t 2 are at distance
i from a. Note that i < . The vertices
at distance are a*, at , bt where a* is
a vertex on the mirror through a. Let
M={a, a1}. Then by Lemma 2, any two
vertices in S1(S2) have distinct M-coordinates. Now among all pairs (x, y), x
S1, y S2 only the pairs ( a2 i , b2 i 1 ),
1 i t 2 1. By Theorem 1, (G(n;
{1, 2}) > 2. Thus M = {a, a1 , a2 } is a
minimum metric basis. Proofs for G(n;
{1,2}) when n=4l+2, 4l+3 or 4l+1
are similar to that of G(n; {1, 2}).
It is important to note that the
mirror through the vertex a does not
pass through any of the diametrically
opposite vertices of a when n= 4l +1
or 4l+ 3. See Figure 4 and Figure 5.
1 i t 2 1 , where a2 (t 2 1) = a*,
are equidistant from both a and b. Now,
include a2 in M. It ready follows that
d( a4 , a2 )d( b3 , a2 ). Now, for
or i>2,
d( a2 i , a2 ) = d( a2 i , a4 ) + d( a4 , a2 )
= i 2 + d( a4 , a2 ).
Journal of Computer and Mathematical Sciences Vol. 1 Issue 2, 31 March, 2010 Pages (103-273)
161
4. CONCLUSION
We have obtained the minimum
metric dimension of undirected circulant
graphs G(n; {1, 2}), G(n; {1, 2,
3}). The problem for G(n; {1, 2 j}),
j > 2 is under investigation.
R E FE R E N C ES
1. G.H. Barnes, R.M. Brown, M. Kato,
D. J. Kuck, D. L. Slotnick, R. A.
Stokes, The ILLIAC IV computers,
IEEE Transactions on computers,
17, 746-757(1968).
2. J.C. Bermond, F. Comellas, and D.F.
Hsu, Distributed loop computer
networks: A survey, ournal of
Parallel and Distributed Computing,
24, 2-10 (1995).
3. Bharati Rajan, Indra Rajasingh, J.
A. Cynthia and Paul Manuel, On
Minimum Metric Dimension, The
Indonesia-Japan Conference on
Combinatorial Geometry and Graph
Theory, September 13-16, 2003,
Bandung, Indonesia.
4. F.T. Boesch and J. Wang, Reliable
Circulant Networks with Minimum
Transmission Delay, IEEE Transactions on Circuit and Systems, 32,
1286-1291 (1985).
5. B. Elspas and J. Turner, Graphs
with circulant adjacency matrices,
Journal of Combinatorial Theory,
9, 297-307 (1970).
6. Gary Chartrand, Linda Eroh, Mark
A. Johnson, Ortrud R. Oellermann,
Resolvability in graphs and the
metric dimension of a graph,
Discrete Applied Mathematics,
Journal of Computer and Mathematical Sciences Vol. 1 Issue 2, 31 March, 2010 Pages (103-273)
162
7.
8.
9.
10.
11.
12.
13
14.
15.
16.
17.
18.
19.
Journal of Computer and Mathematical Sciences Vol. 1 Issue 2, 31 March, 2010 Pages (103-273)