Академический Документы
Профессиональный Документы
Культура Документы
R. B. Jummannaver
Department of mathematics,
Karnatak University,
Dharwad, India.
V. K. Kyalkonda
Department of stastistics,
Karnatak University,
Dharwad, India.
Abstract: The Randi index R(G) of a graph G is defined as the sum of the weights (dG(u)dG(v))-1/2 over all edges e = uv of G. In this
paper we have obtained the Randi index of some class of trees and of their complements. Also further developed an algorithmic
technique to find Randi index of a graph.
Keywords: Algorithm, Degree of a vertex, Randi index, Tree.
1. INTRODUCTION
Let G be an undirected graph without loops and
multiple edges with n vertices and m edges. Let V(G) = {v1, v2,
,vn} be the vertex set of G and E(G)= {e1, e2, , en} be the
edge set of G. There are many types of indices, some based on
distance of a graph and some other based on degrees of vertices
of graphs. In 1975, the Randi index was proposed by the
chemist Milan Randi [6] under the name branching index.
The Randi index R(G) of a graph G is defined as the sum of
the weights (dG(u)dG(v))-1/2 over all edges e = uv of G, where
dG(u) is the degree of a vertex u in G. That is,
R(G)
a b
n
c d e
b c d
Fig.8: T8
2. RESULTS:
Proposition 2.1: If T1 is a tree with n vertices as shown in Fig.1,
then the Randi index of T1 is
x
nx2
1
.
x 1
n x 1
( x 1)(n x 1)
R(T1 )
the edge set E(T1) into 3 sets E1, E2 and E3 such that E1={uv|
d T1 (u)=1 and d T1 (v)=x+1}, E2={uv | d T1 (u)=1 and d T1
(v)=z+1}, E3={ab}. It is easy to see that | E1|=x, | E2|=n-x-2, |
E3|=1.
R T1
c d
Fig3: T3
www.ijcat.com
a b c d e
Therefore,
Fig.6: T6
Fig.7: T7
Fig.2: T2
Fig.1: T1
Fig.5: T5
1
dG (u)dG (v)
uvE (G )
yy
uvE (T1 )
1
dT1 (u )dT1 (v)
Fig.4: T4
590
1
1
1
dT1 (u )dT1 (v) uvE2 (T1 ) dT1 (u)dT1 (v) uvE3 (T1 ) dT1 (u)dT1 (v)
1
1
1
( x 1)(1) uvE2 (T1 ) (n x 2 1)(1) uvE3 (T1 ) ( x 1)(n x 2 1)
uvE1 (T1 )
uvE1 (T1 )
R T5
1
1
1
(n x 2)
( x 1)
(n x 2 1)
( x 1)(n x 2 1)
uvE (T5 )
1
1
1
dG (u )dG (v) uvE2 (T5 ) dG (u )dG (v) uvE3 (T5 ) dG (u )dG (v)
1
1
dG (u )dG (v) uvE5 (T5 ) dG (u )dG (v)
1
1
1
uvE1 (T5 )
uvE4 (T5 )
uvE1 (T5 )
R(T1 )
x
nx2
1
.
x 1
n x 1
( x 1)(n x 1)
R T5
x
n x 3
1
1
x 1
nx2
2( x 1)
2(n x 2)
1
x
nx4
1
1
2
x 1
n x 3
2( x 1)
2(n x 3)
iii R T4 1
x
n x 5
1
1
x 1
nx4
2( x 1)
2(n x 4)
R T5
x 1
y
n x y 3
1
y2
nx y2
( x 1)( y 2)
1
.
( y 2)(n x y 2)
R T6
y
nx y4
1
1
y 1
n x y 3
3( x 1)
3( y 1)
x 1
1
3(n x y 3)
R T7
1
.
( y 2)(n x y 2)
y
n x y 3
1
y2
nx y2
( x 1)( y 2)
x 1
y
z
1
1
y2
z 1
( x 1)( y 2)
( y 2)( z 1)
ii R T3
x 1
i=2,3,4 as follows,
i R T2
1
1
uvE4 (T5 )
1
dG (u )dG (v)
y
n x y 5
1
2
y2
nx y4
2( x 1)
2( y 2)
x 1
1
2( n x y 4)
R T8
(c)=z+1. Partition E(T5)into 5 sets E1, E2, E3, E4, and E5such
that E1={uv| dT5 (u)=1 and dT5 (v)=x+1}, E2={uv | dT5 (u)=1
x 1
y
nx y4
1
1
y2
n x y 3
( x 1)( y 2)
2( y 2)
1
2(n x y 3)
Therefore,
www.ijcat.com
591
1
1
1
(
n
2)
(
n
2)
(
n
2)
x
uv( P1 )
u( P1 )
u( P1 )
v( P3 )
u( P2 )
v( P4 )
n(n 1)
2(n 2)
(n x 2)(n x 3)
(n 2)
n3
nx2
x
R(T1 ) R(G)
2
(n 2)(n x 2)
x(n 2)
R(T1 )
R(T2 )
R(T1 )
uvE (T1 )
1
1
+
dG (u )dG (v) u( P1 ) dG (u )dG (v)
uv( P1 )
u( P1 )
v( P4 )
u( P1 )
v( P4 )
v( P3 )
1
1
1
d (u )dG (v) u( P2 ) dG (u )dG (v) uv( P4 ) dG (u)dG (v)
uv( P1 )
1
dG (u )dG (v)
uv( P4 )
v( P4 )
v( P3 )
v( P4 )
1
(n 1 1)(n 1 1)
www.ijcat.com
n x3
(n 3)(n 2)
n 2 9n 20
2x
x
2(n 2)
(n 2)(n 3)
(n 2)( x 2)
1
1
nx4
(n x 2)(n 3)
( n x 2)( x 2)
( n x 2)( n 2)
1
2(n x 4)
.
(n 3)( x 2)
(n 3)(n 2)
R (T4 )
n 2 11n 30
3x
x
2(n 2)
(n 2)(n 3)
(n 2)( x 3)
2
1
n x 5
(n x 2)(n 3)
( n x 2)( x 3)
( n x 2)( n 2)
1
2
3( n x 5)
.
n3
(n 3)( x 3)
( n 3)(n 2)
1
1
(n 1 1)(n 1 1) u( P1 ) (n 1 1)(n 1 (n x 1))
1
1
(n 1 1)(n 1 1) u( P2 ) (n 1 ( x 1))(n 1 1)
n2 7n 12
x
x
x
2(n 2)
(n 2)(n 3)
(n 2)( x 3)
(n 2)( x 1)
1
n x 3
(n x 2)( x 1)
(n x 2)(n 2)
R (T3 )
n3
nx2
x
2
(n 2)(n x 2)
x(n 2)
P3
P2
x
x(n x 2)
nx2
( n 2)
x(n 2)
(n x 2)(n 2)
P4
P1
v( P4 )
1
1
(n x 2)(n 2) uv( P4 ) (n 2)
R(T5 )
x( x 1)
x
x
xy
2(n 2)
(n 2)(n z 2)
(n 2)(n y 3) n 2
xz
y
1
z
n2
(n x 2)(n 2)
(n x 2)(n z 2)
(n x 2)(n 2)
y ( y 1)
y
yz
z
z ( z 1)
2(n 2)
n
2
2(
n 2)
(n z 2)(n 2)
(n y 3)(n 2)
592
4. ALGORITHM:
An algorithm to find the Randi index of a graph.
a
b
A(G )
c
d
0
1
1
0
1
0
1
1
0
1
1
0
1
Step 1: START
Step 2: Declare: a[25][25],d[25],m as integers
sum1,s[25],sum, ts=0 as floating points.
Step 3: Read m, a[i][j].
Step 4: Compute : Degree of each vertex of given graph
for i to n
d[i] U 0
for j to n
d[i]
U d[i] + a[i][j]
d[i]*d[j]
ts ts+(1/)
Step 7:Display the Randi index by dividing total sum ts by 2.
Step 8:STOP
Illustartion:
G:
c
Fig. 10
www.ijcat.com
5. CONCLUSION
The results give explicit formulas for Randi index of certain
class of trees and also for their complements. Further an
algorithm with the help of adjacency matrix given to compute
the Randi index of graph.
593
6. ACKNOWLEDGEMENTS
This work is supported by the University Grants Commission
(UGC), Govt. of India for support through research grant under
UPE FAR-II grant No. F14-3/2012 (NS/PE).
7. REFERENCES :
1.
2.
3.
4.
5.
6.
7.
8.
9.
PE FAR-
www.ijcat.com
594