Integrated Intelligent Research (IIR) International Journal of Computing Algorithm

Volume: 03, Issue: 01 June 2014, Pages: 54-57

ISSN: 2278-2397

Degree Distance of Some Planar Graphs

S. Ramakrishnan1 J. Baskar Babujee2
1
Department of Mathematics, Sri Sai Ram Engineering College, Chennai, India
2
Department of Mathematics, Anna University, Chennai, India
E-mail: sai_shristi@yahoo.co.in

Abstract - A novel graph invariant: degree distance index was

introduced by Andrey A. Dobrynin and Amide A. Kochetova
[3] and at the same time by Gutman as true Schultz index [4]. 2.1 Construction
In this paper we establish explicit formulae to calculate the
degree distance of some planar graphs.
Starting from the star graph
K1,n
with vertices
v0 , v1 , v2 ,..., vn 
Index terms— Degree distance, planar graph, tree graph, introduce an edge to each of the pendant vertices v1 , v2 ,..., vn to
regular graph, star graph. K1, n, n
get the resulting graph with vertices

I. INTRODUCTION v , v ,..., v , v
0 1 n n 1 ,..., v2 n , again introduce an edge to each of
v n 1 ,..., v2n , K1, n,n,n
Topological indices are numbers associated with molecular the pendant vertices to get the graph .
graphs for the purpose of allowing quantitative structure-  m  1
activity/property/toxicity relationships. Wiener index is the Repeating this procedure times the resulting graph
best known topological index introduced by Harry Wiener to
study the boiling points of alkane molecules. By now there K1,n,n,..., n
exist a lot of different types of such indices (based either on the   
vertex adjacency relationship or on the topological distances)
m times with,
which capture different aspects of the molecular graphs
associated with the molecules under study. For a graph  mn  1 vertices
G  V , E  G is
the degree distance of defined as
{v0 , v1 , v2 ,..., vn , vn 1 ..., v2n , v 2n 1 ,..., v3n ,..., vm 1n 1 ,..., vmn }
DD G    degG u   degG v d G u, v  deg G u  and mn
u ,vV G  where is edges is obtained as shown in Fig. 1.
d u , v 
the degree of the vertex u in G and G is the shortest
distance between and Klein et al. [5] showed that if G is a
u v.

n vertices DD G   4W G   n  n  1
tree on then where
W G    d G u , v 
is the Wiener index of the graph G.
{u , v}V G 

Thus the study of the degree distance for trees is equivalent to

the study of the Wiener index. But the degree distance of a
graph is a more sensitive invariant than the Wiener index.

In this paper we compute the degree distance of some planar

and tree graphs. In Section II, we introduce multi-star graph
K1, n ,n ,...,n
  
m times [2] and calculate its degree distance, in Section III, we
Pln  n  5 
calculate the degree distance of planar graphs and K1, n, n,..., n
Pm  Cn  m  2, n  3
  
and in Section IV, We introduce the graph Fig. 1. Multi-star graph m times
.

operation ê and compute the degree distance of

K1, n, n,...,n
 Pm  Cn eˆ  Pm
1 1 2
 Cn2 .  Result 2.2: Degree distance of the Multi-star graph
  
m times is
  nm
II. MULTI-STAR GRAPH DD  K1, n, n,..., n   6m 2 n  4m 2  3mn  1
     3  
K1, n, n,...,n  m times 
  
m times

In this section we give the construction of multi-star graph and Proof: Let the
 mn  1 vertices of the multi-star graph
calculate its degree distance.
1
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03, Issue: 01 June 2014, Pages: 54-57
ISSN: 2278-2397

K1, n, n,...,n

DD  Pln    deg ui   deg u j d ui , u j
i j
   
   {v0 , v1 , v2 ,..., vn , v n 1 ,..., v2 n ,..., v m 1n 1 ,..., vmn } . Note that
be
m times
degG u1   degG u2   n  1;degG u3   degG un   3;
 
Then, DD  K1, n, n,..., n 
       
deg G u4   ...  deg u n 1  4; dG u1, u j  1, j  2,..., n; 
 m times 
   
  deg  vi   deg v j d vi , v j     
dG u2 , u j  1, j  1,..., n, j  2; dG u j , u j 1  1, j  3,..., n  1;
i j d ui , u j   2; i  3, 4,..., ( n  2);  i  2   j  n
.
=  n  n  2  1  2  ...   m  1  n  n  1 m  
DD  Pln 
 4  2  1  2  2  ...  2   m  1  n  1   n  2   ...  1    n  n  1  2 3  4  n  4    n  2  n  1  2 3  4  n  4 
 4n  n  1  2  1  1  2  1  2  ...  2  1   m  2         
  + 31  2 2 ...
  2   4 1  2 2 ...
  2   2 3
 4n  n  1  2  2  1  2  2  2  ...  2  2  m  3     
n  4  
 
 n 5
 
     
...  4n  n  1  2   m  2   1       
+  4 1  2 2 ...  2   4 1  2  2  ...  2   2 3
         
3n  n  1  2  1   m  1  2  2   m  2   ...  2   m  1  1   
 n 5    n 6  

  
 4n 1  2  ...   m  2   4n 1  2  ...   m  3  ...  4n 1       
+  4 1  2 2 .. .  2   4 1  2 2  ...
  2   2 3
3n  m  1   m  2   ...  2  1   2  2m   n  1  ...  1  
n 6  
 
n  7  
 
  
nm +  4 1  2  2   4 1  2   2 3  4 1  2   4 1  2 3  4 1  3 1
=
3

6m2 n  4m 2  3mn  1 
 10n2  48n  68

III. PLANAR GRAPHS Result 3.2: Degree distance of structured web 3-regular graph
Pm  Cn  m  2, n  3
In this section we compute the degree distance of planar graph is
Pln  n  5
with maximal edges [1], (Fig. 2) and structured
3 2 2
Pm  Cn  m  2, n  3
2

2

 m n n  1  mn m  1 when n is odd  
web graph (Fig. 3). DD  Pm  Cn    4
 3 n3m2  mn 2 m2  1 
when n is even 
Pln  n  5  4
Result 3.1: Degree distance of graph is
DD  Pln   10n 2  48n  68

Pm  C5
Fig. 3. graph.
un
Proof: Case (i) when n is odd.

Fig. 2.
Pln  n  5 
graph.
i j

DD  Pm  Cn    deg ui   deg u j d ui , u j    
Pln  n  5
Proof: Let the n vertices of the graph be
u1 , u2 ,..., un  . Then the degree distance of Pln is

2
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03, Issue: 01 June 2014, Pages: 54-57
ISSN: 2278-2397

DD  Pm  Cn  
Result 4.2: Degree distance of

G  Pm1  Cn1 eˆ Pm2  Cn2   is
1    n 1 
  6  2 1  2  ...       mn  
2
    2   
DD G   DD G1   DD G2  +  6n2  2  DG1 u1, u 
 
12n  m  m  1  n  1    m  1 
n2  1 


   6n1  2  DG2  v1, v   n1  n2  6n1n2
  2  2    
8 
   
 
12 n

   m  2  m  1  n  1 
  m  2 
n 
2
1   
 
Where,
       n12m1
 

2  2  8

 
 4
 
+n1 m1C2 when n1 is even
 
...  12 n  1  2  n  1   1
 n2  1 
  

DG1 u1, u    dG1 u1, u    2
u  u1V G1  
 n1  1 m1 

 

 2  2  
8 


 
 4
 
+n1 m1 C2 when n1 is odd

 6  n  2n  ...   m  1 n   6  n  2n  ...   m  2  n   ...  6  n 

3
 
 m 2n n 2  1  mn 2 m 2  1
4
 

Case (ii) when n is even.

DD  Pm  Cn 


  deg ui   deg u j d ui , u j
i j
   
1     n  n  
=   6  2 1  2  ...    1      mn  
 2     2   2   
  n m  n  n  n m 
6n  2   1 C2    1   m  1   m  1  C2  
  2   2  2  2 
   n  m 1  n  n  n 
C2    1   m  2    m  2    C2  
m 1
 6n  2   1 
  2   2  2  2  Fig. 4. Graph  Pm  C3  eˆ  Pm
1 2
 C6  .

  n   n  n  n 
+...+ 6n  2   1 2C2    1  1  1  2C2    mn m2  1
  2   2  2  2 
   n22m2

 4
+n2 m2 C2  
when n2 is even
DG2 v1, v    dG2 v1, v    2
3 
 n2  1 m2 
= n3m2  mn 2 m 2  1
4
  v  v1V G2 

 4
 
+n2 m2 C2 when n2 is odd

Proof: Let an edge be introduced between the arbitrary vertex

IV. NEW GRAPH OPERATION ê u1 of G1 and the arbitrary vertex v1 of G2 , then the degree


ˆ 2  Pm1  Cn1 eˆ Pm2  Cn2
G  G1eG   is given by
In this section we introduce new graph operation ê and distance of

establish the degree distance of

 Pm  Cn  eˆ  Pm
1 1 2
 Cn2 .
ˆ
Definition 4.1: G1eG2 is a connected graph obtained from G1
and G2 by introducing an edge e between an arbitrary vertex of
G1 and an arbitrary vertex of G2 .

G  p ,q  G  p ,q 
If 1 1 1 has p1 vertices and q1 edges and 2 2 2 has
p2 vertices and q2 edges then G1eG ˆ 2
will have
 p1  p2 
vertices and
 q1  q2  1 edges. If G1  Pm1  Cn1 and
G2  Pm2  Cn2 ˆ
an interesting graph structure G  G1eG2
(example shown in Fig. 4) is obtained by using the new graph
operation defined above and we prove the following result.

3
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03, Issue: 01 June 2014, Pages: 54-57
ISSN: 2278-2397

DD G 


  degG1  ui   deg G1 u j d G1 ui , u j     Similarly,
i j


  degG2  vi   degG2 v j dG2 vi , v j     DG2 v1 , v    dG2 v1 , v 
i j v  v1 V G2 

n2 m2  m2  1 m2  n2  1
m1n1 m2 n2
 degG ui   degG v j dG ui , v j 
2
+
i 1 j 1
1 2
  when n2 is odd
2 4
 DD G1    dG1 u , u1   DD G2    d G2 v, v1 
u  u1V G1  v  v1V G2 
m1n1 m2 n2
   degG ui   degG v j  dG ui , u1   1  dG v1, v j 
1 2 1 2
Using Result 3.2,
3 2 2
i 1 j 1

 4 m1 n1  n1  1  m1n1  m1  1 when n1 is odd

2 2
 DD G1    dG1 u1 , u   DD G2    d G2 v1 , v 


u  u1V G1 

dG1 u1, u   6n2n1

v  v1V G2 

DD G1   DD Pm1  Cn1   
 3 n 3m 2  m n 2  m 2  1
+6n2
u  u1V G1  when n1 is even
  dG1 u1 , u    n1  1  2   n2  1  4 1 1 1 1 1
u  u1V G1 
3 2
 4 m2 n2  n2  1  m2n2 m2  1 when n2 is odd
2 2 2
 6n1  d G2  v1 , v    d G2 v1, v 
v  v1V G2  v  v1V G 2 

DD G2   DD Pm2  Cn2   
DD G   DD G1   DD G2   +  6n2  2  DG1 u1, u   3 n 3m 2  m n 2  m 2  1 when n2 is even
  6n1  2  DG2  v1, v   n1  n2  6n1n2  4 2 2 2 2 2

DG1 u1 , u 
To find when n1 is even, V. CONCLUSIONS
DG u1 , u 
1

 
u  u1 V G1 
dG1 u1 , u  In this paper we have computed the degree distance index of
some planar graphs. Nevertheless, there are still many classes
  n  n 
  2 1  2  ...   1  1   1  of interesting and chemically relevant graphs not covered by
  2  2 
our approach. So it would be interesting to find explicit
   n    n 
+  2  1  1   2  1  ...    1  1   1     1  1    1 formulae for computing the degree distance and other
   2    2  
topological indices for various classes of chemical graphs.
    n1     n1 
+  2  1  2    2  2   ...     1  2      2    2+...
   2    2   REFERENCES
   n  
 n 
+  2  1   m  1  ...    1  1   m1  1     1   m1  1 
 2   2  [1] J. Baskar Babujee, “Planar graphs with maximum edges-antimagic
   
property”, The Mathematics Education, vol. XXXVII, No. 4, pp. 194-
  m1  1 198, 2003.
n1m1  m1  1 m1n12 [2] J. Baskar Babujee, D. Prathap, “Wiener number for some class of Planar
 
2 4 graphs”, National Symposium on Mathematical Methods and
Applications organized by IIT, Madras, 2005.
[3] Andrey A. Dobrynin, Amide A. Kochetova, “Degree Distance of a
Similarly, Graph: A Degree analogue of the Wiener Index”, J. Chem. Inf. Comput.
Sci., vol. 34, pp. 1082 -1086, 1994.
DG2  v1 , v   
v  v1 V G2 
d G2 v1 , v  [4] I. Gutman, “Selected properties of the Schultz molecular topological
index”, J. Chem. Inf. Comput. Sci., vol. 34, pp. 1087 –1089, 1994.

n m  m  1 m2 n2 2 [5] D. J. Klein, Z. Mihalic , D. Plavsic and N. Trinajstic , “Molecular
 2 2 2  when n2 is even
2 4 topological index: A relation with the Wiener index”, J. Chem. Inf.
Comput. Sci., vol. 32, pp. 304-305, 1992.
DG1 u1 , u 
To find when n1 is odd,
DG1 u1 , u   
u  u1 V G1 
d G1 u1 , u 

DG1 u1 , u 
   n  1  
  2  1  2  ...   1  
   2  
    n  1  
+  2  1  1   2  1  ...    1   1    1
    2    
   n 1   
+  2  1  2    2  2   ...    1   2    2
    2    
   n 1  
+...+  2  1   m  1  ...    1    m1  1      m1  1
   2    
n1m1  m1  1 m1  n12  1
 
2 4
4