Open Journal of Discrete Mathematics, 2013, 3, 143-150

doi:10.4236/ojdm.2013.33026 Published Online July 2013 (http://www.scirp.org/journal/ojdm)

Some Results on Generalized Degree Distance

Asma Hamzeh, Ali Iranmanesh*, Samaneh Hossein-Zadeh
Department of Mathematics, Faculty of Mathematical Sciences, Tarbiat Modares University, Tehran, Iran
Email: *iranmanesh@modares.ac.ir

Received January 14, 2013; revised February 15, 2013; accepted May 14, 2013

Copyright © 2013 Asma Hamzeh et al. This is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

ABSTRACT
In [1], Hamzeh, Iranmanesh Hossein-Zadeh and M. V. Diudea recently introduced the generalized degree distance of graphs.
In this paper, we present explicit formulas for this new graph invariant of the Cartesian product, composition, join, dis-
junction and symmetric difference of graphs and introduce generalized and modified generalized degree distance poly-
nomials of graphs, such that their first derivatives at x = 1 are respectively, equal to the generalized degree distance and
the modified generalized degree distance. These polynomials are related to Wiener-type invariant polynomial of graphs.

Keywords: Generalized Degree Distance; Cartesian Product; Join; Symmetric Difference; Composition; Disjunction

1. Introduction graph with vertex set V1  V2 and u   u1 , v1  is adja-

cent to v   u2 , v2  whenever ( u1 is adjacent with u2 )
A graph invariant is any function on a graph that does not
or ( u1  u2 and v1 is adjacent to v2 ), [3, p. 185]. The
depend on a labeling of its vertices. Topological indices
disjunction G  H of graphs G and H is the graph
and graph invariants based on the distances between the
with vertex set V  G  V  H  and  u1 , v1  is adjacent
vertices of a graph are widely used in theoretical chemis-
to  u2 , v2  whenever u1u2  E  G  or v1v2  E  H  .
try to establish relations between the structures and the
The symmetric difference G  H of two graphs G
properties of molecules. Topological indices provide
and H is the graph with vertex set V  G  V  H  and
correlations with physical, chemical and thermodynamic
parameters of chemical compounds [2]. In this paper, we E G  H    u , u 1 2  v1 , v2  u1v1  E  G  or
only consider simple and connected graphs. Let G be a .
graph on n vertices and m edges. We denote the ver- u2 v2  E  H  but not both 
tex and the edge set of G by V  G  and E  G  , respec-
The first Zagreb index was originally defined as
tively. As usual, the distance between the vertices u
M1  G    dG  u 
2
and v of G, denoted by dG  u, v  ( d  u , v  for short), [4]. The first Zagreb index can
uV  G 
is defined as the length of a minimum path connecting
them. We let dG  v  be the degree of a vertex v in G. be also expressed as a sum over edges of G ,
The eccentricity, denoted by   v  , is defined as the M1  G     dG  u   dG  v  . We refer readers to [5]
uvE  G 
maximum distance from vertex v to any other vertex.
The diameter of a graph G, denoted by diam  G  , is the for the proof of this fact and for more information on
maximum eccentricity over all vertices in a graph G. Zagreb index. The first Zagreb coindex of a graph G is
The Cartesian product G  H of graphs G and H is a defined in [6] as:
graph such that V  G  H   V  G  V  H  , and any two M1  G    dG  u   dG  v  .
vertices  a, b  and  u, v  are adjacent in G  H if

 EG 
uv
and only if either a  u and b is adjacent to v , or
b  v and a is adjacent to u , see [3] for details. Let Let d  G, k  be the number of pairs of vertices of a
G1 and G2 be two graphs with disjoint vertex sets V1 graph G that are at distance k ,  be a real number,
and V2 and edge sets E1 and E2 . The join G1  G2 and W  G    d  G, k  k  , that is called the Wiener-
k 1
is the graph union G1  G2 together with all the edges
joining V1 and V2 . The composition G1 G2  is the type invariant of G associated to  , see [7,8] for de-
tails. Additively weighted Harary index is defined in [9]
*
Corresponding author. as

Copyright © 2013 SciRes. OJDM

144 A. HAMZEH ET AL.

H A G    d 1  u, v   dG  u   dG  v  . product of graphs. In [9,20-24], exact formulae for the

u ,vV  G  hyper-Wiener, the first Zagreb index, the second Zagreb
index and Schultz polynomials of some graph operations
Dobrynin and Kochetova in [10] and Gutman in [11]
were computed.
introduced a new graph invariant with the name degree
Throughout this paper, Cn , Pn , K n and S n denote
distance that is defined as follows:
the cycle, path, complete graph and star on n vertices.
D  G    d  u, v   dG  u   dG  v  . The complement of a graph G is a graph H on the
u ,vV  G  same vertices such that two vertices of H are adjacent
In [12], the modified degree distance was defined as if and only if they are not adjacent in G . The graph H
follows: is usually denoted by G . Our other notations are stan-
dard and taken mainly from [2,25,26].
S  G    dG  u, v   dG  u  dG  v  . In this paper we present explicit formulas for H   G 
u ,vV  G  of graph operations containing the Cartesian product,
The generalized degree distance, denoted by H   G  , composition, join, disjunction and symmetric difference
is defined as follows in [1]. of graphs and introduce generalized and modified gener-
For every vertex x and real number  , H   x  is alized degree distance polynomials of graphs, such that
defined by H   x   D   x  dG  x  , where their first derivatives at x  1 are respectively, equal to
the generalized degree distance and the modified gener-
D  x    d   x, y  . We then define
yV  G  alized degree distance. These polynomials are related
with Wiener-type invariant polynomial of graphs.
H G    H  x    D   x  dG  x 
xV  G  xV  G  2. Main Results
  d 
 u, v   dG  u   dG  v  . The aim of this section is to compute the generalized
u , vV  G 
degree distance for five graph operations. We start with a
If   0 , then H   G   4 m . When   1 , this new lemma which gives some information about the number
topological index  H   G   is equal to the degree dis- of vertices and edges of operations on two arbitrary
tance (or Schultz index). There are many papers for graphs. For a given graph Gi , the number of vertices
studying this topological index, for example see [13-16]. and edges will be denoted by ni and mi , respectively.
Also if   1 , then H   G   H A  G  . Therefore the Lemma 2.1. [3,20] Let G and H be graphs. Then
study of this new topological index is important and we we have:
try to obtain some new results related to this topological a)
index. The modified generalized degree distance, de-
V  G  H   V  G  H   V  G  H   V  G  H 
noted by H   G  , is defined in [1] as:
 V G   V  H  ,
H   G    d   u, v   dG  u  dG  v  .
u , vV  G  E G  H   E G   V  H   V G   E  H  ,
If   1 , then H   G   S   G  . E G  H   E G   E  H   V G   V  H  ,
We construct graph polynomials having the property
E  G  H   E  G   V  H   E  H   V  G  ,
2
such that their first derivatives at x  1 are equal to the
generalized degree distance, the modified generalized
E G  H   E G   V  H   E  H   V G 
2 2
degree distance and Wiener-type invariant respectively.
These polynomials are defined as follows: 2 E  G   E  H  ,
H   G, x     dG  u   dG  v   x d   u ,v 
, and
u ,vV  G 
E G  H   E G   V  H   E  H   V G 
2 2

  dG  u  dG  v   x d

 u ,v 
H   G , x   ,
u ,vV  G 
4 E  G   E  H  .
and
d   u ,v 
b) The graph G  H is connected if and only if G
W  G, x    x . and H are connected.
u ,vV  G 
c) If  a, c  and  b, d  are vertices of G  H , then
The Wiener index of the Cartesian product of graphs d G  H   a , c  ,  b, d    d G  a , b   d H  c , d  .
was studied in [17,18]. In [19], Klavžar, Rajapakse and d) The Cartesian product, join, composition, disjunc-
Gutman computed the Szeged index of the Cartesian tion and symmetric difference of graphs are associative

Copyright © 2013 SciRes. OJDM

 A. HAMZEH ET AL. 145

and all of them are commutative except the composition u, v V  G1  G2  , the distance dG1 G2  u , v  is either 1
of graphs. or 2. In the formula for H   G1  G2  , we partition the
e)
set of pairs of vertices of G1  G2 into three subsets
dG  H  u , v  A0 , A1 and A2 . In A0 we collect all pairs of vertices u
and v such that u is in G1 and v is in G2 . Hence, they
0, u  v
 . are adjacent in G1  G2 . The set Ai , i  1, 2 is the set of
 1, uv  E  G  or uv  E  H  or  u  V  G  v  V  H   . pairs of vertices u and v which are in Gi . Also we parti-
 tion the sum in the formula of H   G1  G2  into three
2, otherwise
sums Si so that Si is over Ai for i  0,1, 2 . For S0
f) we obtain
 d G  a, c  , a  c

S0     dG  u   dG  v   n1  n2 
1 2
uV  G1  vV  G2 
0, ac&bd
d G H    a , b  ,  c, d     .  n1n2  n1  n2   2n2 m1  2n1m2 ,
1, a  c & bd  E  H 
2, and
a  c & bd  E  H 
 S1    dG  u   dG  v   2n2  dG G  u, v 
1 1 1 2
g) u , vV  G1 

0, a  c & b  d    dG  u   dG  v   2n2 

1 2
uvE  G1 

dG  H   a, b  ,  c, d    1, ac  E  G  or bd  E  H  .
2, otherwise   
2 dG1  u   dG2  v   2n2 
 uvE  G1 

h)  M 1  G1   2n2 m1  2 M 1  G1   2 1 n2 m1 .

d G  H   a , b  ,  c, d   Similarly,

0, a  c & b  d S2  M 1  G2   2n1m2  2 M 1  G2   2 1 n1m2 .


 1, ac  E  G  or bd  E  H  but not both. Therefore
2, otherwise H   G1  G2 

 S0  S1  S2
i) dG H   a, b    d G  a   d H  b  . □
 n1n2  n1  n2   4n2 m1  4n1m2  M 1  G1   M 1  G2 
j) dG H    a, b    V  H  dG  a   d H  b  .
2  M 1  G1   M 1  G2    2 1  n2 m1  n1m2  .
dG  a   V  H  , a  VG
k) dG  H  a    . Corollary 2.3. Let G be a connected graph with n ver-
d H  a   V  G  , a  V  H  tices and m edges. Then
l) H   K1  G   n  n  1  4m  M 1  G 
.
dG  H   a, b    V  H  d G  a   V  G  d H  b  2 M 1  G   2 1 m

dG  a  d H  b  . The exact formulas H   G  for the fan graph K1 + Pn

m)
dG  H   a, b    V  H  d G  a   V  G  d H  b 
2 d G  a  d H  b  .
In Theorem 2.2, we give a formula for the generalized
degree distance of the join of two graphs.
Theorem 2.2. Let G1 and G2 be two graphs. Then
H   G1  G2 
 n1n2  n1  n2   4n2 m1  4n1m2  M 1  G1   M1  G2 
2  M 1  G1   M 1  G2    2 1  n2 m1  n1m2  .
Proof. It is obvious from definition that for any
and for the wheel graph Wn  K1  Cn are given in the
following Corollary.
Corollary 2.4.
H   K1  Pn   n2  9n  10  2  n  2  5n  9  ,
and
H   K1  Cn   n2  9n  3  2 n  n  3 .
Remark 2.5. In the above theorem, if   1 , then we
obtain D  G1  G2  , which gives first derivatives for-
mula Theorem 3 in [22] at x  1 .
In the next theorem we obtain the exact formula for
the generalized degree distance of the composition of
two graphs.
Theorem 2.6. Let G1 and G2 be two graphs. Then

Copyright © 2013 SciRes. OJDM

146 A. HAMZEH ET AL.

H   G1 G2   4m2 m1n2  n1 M 1  G2   2  2 m2 n2 m1 Proof. Suppose u1 , , un1 

and v1 , , vn2 are   
two set of vertices of G1 and G2 , respectively. Then
2 n1 M 1  G2   n H   G1   4n2 m2W  G1 
 3
2 by Lemma 2.1 and definition of H  , we have:

H   G1 G2   
u , vV  G1 G2 

dG1 G2   u , v  dG1 G2   u   dG1 G2   v  

1
 
  d   ui , vk  ,  u j , vl  ndG1  ui   dG2  vk   ndG1  u j   dG2  vl 
2  ui ,vk   u j ,vl  G1 G2 


 dG G    u p , vk  ,  u p , vl    2n2 dG  u p   dG  vk   dG  vl  
n1 n2
 1 2 1 2 2
p 1 k ,l 1

    
n2 n1
  dG1 G2   ui , vk  ,  u j , vl  n2 dG1  ui   dG1  u j   dG2  vk   dG2  vl 
k , l 1 i , j 1, i  j

 
n1 n2
  2 2n2 dG1  u p   dG2  vk   dG2  vl   n23 H   G1   4n2 m2W  G1 
p 1 k , l 1,uk vl E  G2 

 4m2 m1n2  n1 M 1  G2   2  2 m2 n2 m1  2 n1 M 1  G2   n23 H   G1   4n2 m2W  G1  .

So the proof of theorem is now completed. □ and

By composing paths and cycles with various small H   Cn  K 2   9n  8  H   Cn   W  Cn   .
graphs we can obtain classes of polymer-like graphs.
Remark 2.8. In Theorem 2.6, if   1 , then we obtain
Now we give the formula of the H  index for the fence
D  G1 G2  , which gives first derivatives formula

graph Pn  K 2  and the closed fence Cn  K 2  .
Corollary 2.7. Theorem 5 in [22] at x  1 .
Now we prove the theorem that characterizes the gen-
H   Pn  K 2   9n  8  8  H   Pn   W  Pn   ,
eralized degree distance of the disjunction of two graphs.

Theorem 2.9. Let G1 and G2 be two graphs. Then

 
H   G1  G2   8n1n2 m1m2  n13  4n1 m1 M 1  G2   n23  4n2 m2 M 1  G1   M 1  G1  M 1  G2   
 
2  2n2 m2  n2 2  2m2 M 1  G1   2n1m1  n12  2m1 M 1  G2  
   
2 M 1  G1  M 1  G2   2  2  n1m1m2  n2 m2 m1 

Proof. According to definition of G1  G2 , we have the following relations:

S1     n2 dG  x   n1dG  u   dG  x  dG  u   n2 dG  y   n1dG  v   dG  y  dG  v  
1 2 1 2 1 2 1 2
u , vV  G1  uvE  G2 

  
 x , yV  G1  uvE  G2 
n d 1 G2  u   dG  v    n2  dG  y   dG  x    dG  x  dG  u   dG  y  dG  v  
2 1 1 1 2 1 2

 n13 M 1  G2   4n1m2 m1n2  2n1m1 M 1  G2  ,

S2     n2 dG  x   n1dG  u   dG  x  dG  u   n2 dG  y   n1dG  v   dG  y  dG  v  
1 2 1 2 1 2 1 2
xyE  G1  u , vV  G2 

 n23 M 1  G1   4n1m2 m1n2  2n2 m2 M 1  G1  ,

S3     n2 dG  x   n1dG  u   dG  x  dG  u   n2 dG  y   n1dG  v   dG  y  dG  v  
1 2 1 2 1 2 1 2
xyE  G1  uvE  G1 

 2n1m1M 1  G2   2n2 m2 M 1  G1   M 1  G1  M 1  G2  ,

and

Copyright © 2013 SciRes. OJDM

 A. HAMZEH ET AL. 147

S4   
xyE  G1  , x  y uvE  G2  ,u  v

2 n2 dG1  x   n1dG2  u   dG1  x  dG2  u   n2 dG1  y   n1dG2  v   dG1  y  dG2  v  
2  
xyE  G1  uV  G2 
 2n d1 G2  u    n2  dG  u    dG  x   dG  y   
2 1 1

2  
xV  G1  uvE  G2 
 2n d2 G1  x    n1  dG  x    dG  u   dG  v   
1 2 2

   
 2  2n2 m2  n22  2m2 M 1  G1   2n1m1  n12  2m1 M 1  G2   M 1  G1  M 1  G2    2  2  n1m1m2  n2 m2 m1  .
So we have:
H   G1  G2 
 
 S1  S2  S4  S3  8n1n2 m1m2  n13  4n1m1 M 1  G2   n23  4n2 m2 M 1  G1   M 1  G1  M 1  G2   
   
2  2n2 m2  n22  2m2 M 1  G1   2n1m1  n12  2m1 M 1  G2    2 M 1  G1  M 1  G2   2  2  n1m1m2  n2 m2 m1  .

This completes the proof. □

Now we prove the theorem that characterizes the generalized degree distance of the symmetric difference of two
graphs.
Theorem 2.10. Let G1 and G2 be two graphs. Then
 
H   G1  G2   8n1n2 m1m2  n13  8n1m1 M 1  G2   n23  8n2 m2 M 1  G1   4 M 1  G1  M 1  G2   
 
2  2n2 m2  n2 2  4m2 M 1  G1   2n1m1  n12  4m1 M 1  G2    
2 M 1  G1  M 1  G2   2  2  n1m1m2  n2 m2 m1 
Proof. We consider four sums S1 , , S4 as follows:
S1     n2 dG  x   n1dG  u   2dG  x  dG  u   n2 dG  y   n1dG  v   2dG  y  dG  v  
1 2 1 2 1 2 1 2
 x , yV  G1  uvE  G2 

 n13 M 1  G2   4n1m2 m1n2  4n1m1 M 1  G2  ,

similarly to S1
S 2  n23 M 1  G1   4n1m2 m1n2  4n2 m2 M 1  G1  ,
S3     n2 dG  x   n1dG  u   2dG  x  dG  u   n2 dG  y   n1dG  v   2dG  y  dG  v  
1 2 1 2 1 2 1 2
xyE  G1  uvE  G2 

 2n1m1 M 1  G2   2n2 m2 M 1  G1   2 M 1  G1  M 1  G2  ,
and
S4   
xyE  G1  , x  y uvE  G2  , u  v

2 n2 dG1  x   n1dG2  u   2dG1  x  dG2  u   n2 dG1  y   n1dG2  v   2dG1  y  dG2  v  
2  
xyE  G1  uV  G2 
 2n d 1 G2  u    n2  2dG  u    dG  x   dG  y   
2 1 1

2  
xV  G1  uvE  G2 
 2n d 2 G1  x    n1  2dG  x    dG  u   dG  v   
1 2 2

  
 2  2n2 m2  n22  4m2 M 1  G1   2n1m1  n12  4m1 M 1  G2   2 M 1  G1  M 1  G2  
  
2  n1m1m2  n2 m2 m1  .
 2

By the definition of G1  G2 , we have:


H   G1  G2   S1  S2  S4  2 S3  8n1n2 m1m2  n13  8n1m1 M 1  G2   n23  8n2 m2 M 1  G1   4 M 1  G1  M 1  G2    
  
2  2n2 m2  n22  4m2 M 1  G1   2n1m1  n12  4m1 M 1  G2   2 M 1  G1  M 1  G2  
  
2  2  n1m1m2  n2 m2 m1  .
So the proof is now completed. □

Copyright © 2013 SciRes. OJDM

148 A. HAMZEH ET AL.

In the next theorem we find the generalized degree distance of the Cartesian product of two graphs.
Theorem 2.11. Let G1 and G2 be two graphs. Then
 
H   G1  G2   n12 H   G2  4m1n1W  G2   2    H1  G1  W 1  G2   W  G1  H  1  G2  
1
    
2    H 2  G1  W  2  G2   W2  G1  H   2  G2      2    H  1  G1  W  G2   W 1  G1  H1  G2  
2    1
 n22 H   G1   4m2 n2W  G1  .

Proof. Suppose u1 , , un1 and  v ,, v 
1 n2 are two set of vertices of G1 and G2 , respectively. Then by Lemma
2.1 and definition of H  , we have:
H   G1  G2    
dG1 G2  u, v  dG1 G2  u   dG1 G2  v  
u , vV  G1 G2 


1
  dG G
2  ui ,vk   u j ,vl  1 2
u , v  , u , v   d
i k j l G1  ui   dG  vk   dG
2 1
u   d v 
j G2 l

1 n2 n1
 
dG1  ui , u j   dG2  vk , vl  dG1  ui   dG2  vk   dG1  u j   dG2  vl  

  
2 k ,l 1 i , j 1
1 n2 n1   

     r dGr1  ui , u j  dG2 r  vk , vl   dG1  ui   dG2  vk   dG1  u j   dG2  vl 
2 k ,l 1 i , j 1  r  0 

 
 n12 H   G2   4m1n1W  G2   2    H1  G1  W 1  G2   W  G1  H  1  G2  
1
 
2    H 2  G1  W  2  G2   W2  G1  H   2  G2  
2
  
  2    H  1  G1  W  G2   W 1  G1  H1  G2    n2 H   G1   4m2 n2W  G1  .
2

   1 

So the proof is now completed. □ Corollary 2.13. By Theorem 2.9 and Lemma 2.12 we
As an application of the above theorem, we list ex- have:
plicit formulae for the generalized degree distance of H   Cn  Cm 
Pn  Pm , Pn  Cm and Cn  Cm . These graphs are known
as the rectangular grid, the C4 nanotube, and the C4  n 2 H   Cm   4n 2W  Cm   m 2 H   Cn   4m 2W  Cn 
nanotorus, respectively.  1 
 
k 2    H i  Cn W  i  Cm   H  i  Cn  Wi  Cm  ,
Lemma 2.12. Define   k , r    i r . By [1,23], we i 1  i 
i 1
H   Pn  Pm 
have:
 n 2 H   Pm   4n  n  1 W  Pm   m 2 H   Pn 
W  Pn   n  n  1,      n  1,   1 ,
4m  m  1W  Pn 

 n  n n  1 
n   1,      , n is even  
 2    H i  Pn  W i  Pm   H  i  Pn Wi  Pm  ,
W  Cn    
2  2 2 , i 1  i 
 n  n  1 ,   , n is odd and
  2 

H   Pn  Cm 
H   Pn   2  n  3,    4n  n  3,  
 n2 H   Cm   4n  n  1 W  Cm 
4  n  3,   1  2  n  1  6  n  2  ,
 

 m2 H   Pn   4m2W  Pn 
 1
 n  n  1 
 
4n   1,      , n is even 2    H i  Pn  W i  Cm   H  i  Pn  Wi  Cm  .
 2  2
H   Cn    . i 1  i 

4n  n  1 ,   , n is odd Remark 2.14. In the above theorem, if   1 , then we

  
 2  obtain D   G1  G2  , which gives first derivatives for-

Copyright © 2013 SciRes. OJDM

 A. HAMZEH ET AL. 149

mula Theorem 1 in [22] at x  1 . This completes the proof. □

Now we obtain the relation between the generalized
degree distance polynomial and Wiener-type invariant
REFERENCES
polynomial and the relation between the modified gener-
alized degree distance polynomial and Wiener-type in- [1] A. Hamzeh, A. Iranmanesh, S. Hossein-Zadeh and M. V.
variant polynomial for graphs. Diudea, “Generalized Degree Distance of Trees, Unicy-
clic and Bicyclic Graphs,” Studia Ubb Chemia, LVII, Vol.
Theorem 2.15. If G is a graph with n vertices and
4, 2012, pp. 73-85.
m edges, then
[2] M. V. Diudea, I. Gutman and L. Jantschi, “Molecular
  dG  u   dG  v   2  x d

H   G, x   u ,v  Topology,” Nova Science, Huntington, 2001.
u  vV G   [3] W. Imrich and S. Klavžar, “Product Graphs: Structure
4m  2n  2W  G , x  . and Recognition,” John Wiley & Sons, New York, 2000.
[4] I. Gutman and N. Trinajstic, “Graph Theory and Molecu-
Proof. By definition, we have lar Orbitals. Total π-Electron Energy of Alternant Hydro-
  dG  u   dG  v   x d

 u ,v  carbons,” Chemical Physics Letters, Vol. 17, No. 4, 1972,
H   G, x  
u , vV  G 
pp. 535-538. doi:10.1016/0009-2614(72)85099-1
[5] S. Nikolic, G. Kovacevic, A. Milicevic and N. Trinajstic,
  dG  u   dG  v   2  x d

u ,v 
 “The Zagreb Indices 30 Years after,” Croatica Chemica
u  vV  G 
Acta, Vol. 76, No. 2, 2003, pp. 113-124.
  dG  u   dG  v   2  x d

 u ,v 
 [6] T. Došlic, “Vertex-Weighted Wiener Polynomials for Com-
u  vV  G  posite Graphs,” Ars Mathematica Contemporanea, Vol. 1,
d  u ,v  No. 1, 2008, pp. 66-80.
2  x
[7] I. Gutman, “A Property of the Wiener Number and Its
u , vV  G 
Modifications,” Indian Journal of Chemistry, Vol. 36A,
  dG  u   dG  v   2  x d

u ,v 
 No. 2, 1997, pp. 128-132.
u  vV  G 
[8] I. Gutman, A. A. Dobrynin, S. Klavžar and L. Pavlovic,
4m  2n  2W  G, x  . “Wiener-Type Invariants of Trees and Their Relation,”
Bulletin of the Institute of Combinatorics and Its Applica-
This completes the proof. □ tions, Vol. 40, No. 1, 2004, pp. 23-30.
Theorem 2.16. If G is a graph with n vertices and [9] Y. Alizadeh, A. Iranmanesh and T. Došlic, “Additively
m edges, then Weighted Harary Index of Some Composite Graphs,”
Discrete Mathematics, Vol. 313, No. 1, 2013, pp. 26-34.
  dG  u   1  dG  v   1 x d

H   G , x   u ,v 
doi:10.1016/j.disc.2012.09.011
u  vV  G 
[10] A. A. Dobrynin and A. A. Kochetova, “Degree Distance
 M 1  G   4m  n  H   G , x   W  G , x  . of a Graph: A Degree Analogue of the Wiener Index,”
Journal of Chemical Information and Computer Sciences,
Proof. By definition, we have Vol. 34, No. 5, 1994, pp. 1082-1086.
H   G, x  doi:10.1021/ci00021a008
[11] I. Gutman, “Selected Properties of the Schultz Molecular
  dG  u  dG  v   x d

u ,v 
 Topological Index,” Journal of Chemical Information and
u , vV  G  Computer Sciences, Vol. 34, No. 5, 1994, pp. 1087-1089.
  dG  u   1 dG  v   1 x d

u ,v  doi:10.1021/ci00021a009

u  vV  G  [12] I. Gutman, and S. Klavžar, “Wiener Number of Vertex-
Weighted Graphs and a Chemical Applications,” Discrete
  dG  u   1 dG  v   1 x
d  u ,v 
 Applied Mathematics, Vol. 80, No. 1, 1997, pp. 73-81.
u  vV  G  doi:10.1016/S0166-218X(97)00070-X

  dG  u   dG  v   x
 u ,v d  u ,v 
 
   [13] H. Hua and S. Zhang, “On the Reciprocal Degree Distance
d
x
u , vV  G  u , vV  G  of Graphs,” Discrete Applied Mathematics, Vol. 160, No.
7-8, 2012, pp. 1152-1163. doi:10.1016/j.dam.2011.11.032
  dG  u   1 dG  v   1 x

u ,v 

d
[14] S. Hossein-Zadeh, A. Hamzeh and A. R. Ashrafi, “Extre-
u  vV  G 
mal Properties of Zagreb Coindices and Degree Distance
  dG2  u   4m  n  H   G, x   W  G, x  of Graphs,” Miskolc Mathematical Notes, Vol. 11, No. 2,
uV  G  2010, pp. 129-137.

  dG  u   1  dG  v   1 x d

u ,v  [15] I. Tomescu, “Unicyclic and Bicyclic Graphs Having Mini-

u  vV  G 
mum Degree Distance,” Discrete Applied Mathematics,
Vol. 156, No. 1, 2008, pp. 125-130.
 M 1  G   4m  n  H   G, x   W  G, x  . doi:10.1016/j.dam.2007.09.010

Copyright © 2013 SciRes. OJDM

150 A. HAMZEH
[16] I. Tomescu, “Some Extremal Properties of the Degree
Distance of a Graph,” Discrete Applied Mathematics, Vol.
98, No. 1-2, 1999, pp. 159-163.
doi:10.1016/S0166-218X(99)00117-1
[17] A. Graovac and T. Pisanski, “On the Wiener Index of a
Graph,” Journal of Mathematical Chemistry, Vol. 8, No.
1, 1991, pp. 53-62. doi:10.1007/BF01166923
[18] B. E. Sagan, Y.-N. Yeh and P. Zhang, “The Wiener Poly-
nomial of a Graph,” International Journal of Quantum
Chemistry, Vol. 60, No. 5, 1996, pp. 959-969.
doi:10.1002/(SICI)1097-461X(1996)60:5<959::AID-QU
A2>3.0.CO;2-W
[19] S. Klavžar, A. Rajapakse and I. Gutman, “The Szeged
and the Wiener Index of Graphs,” Applied Mathematics
Letters, Vol. 9, No. 5, 1996, pp. 45-49.
doi:10.1016/0893-9659(96)00071-7
[20] M. H. Khalifeh, H. Yousefi-Azari and A. R. Ashrafi,
“The Hyper-Wiener Index of Graph Operations,” Com-
puters & Mathematics with Applications, Vol. 56, No. 5,
2008, pp. 1402-1407. doi:10.1016/j.camwa.2008.03.003
Copyright © 2013 SciRes.
ET AL.
[21] M. Eliasi and A. Iranmanesh, “The Hyper-Wiener Index
of the Generalized Hierarchical Product of Graphs,” Dis-
crete Applied Mathematics, Vol. 159, No. 8, 2011, pp.
866-871. doi:10.1016/j.dam.2010.12.020
[22] M. Eliasi and B. Taeri, “Schultz Polynomials of Compos-
ite Graphs,” Applicable Analysis and Discrete Mathemat-
ics, Vol. 2, No. 2, 2008, pp. 285-296.
doi:10.2298/AADM0802285E
[23] S. Hossein-Zadeh, A. Hamzeh and A. R. Ashrafi, “Wiener-
Type Invariants of Some Graph Operations,” Filomat, Vol.
29, No. 3, 2009, pp. 103-113. doi:10.2298/FIL0903103H
[24] M. H. Khalifeh, H. Yousefi-Azari and A. R. Ashrafi,
“The First and Second Zagreb Indices of Some Graph
Operations,” Discrete Applied Mathematics, Vol. 157, No.
4, 2009, pp. 804-811. doi:10.1016/j.dam.2008.06.015
[25] F. Harary, “Graph Theory,” Addison-Wesley, Reading,
1969.
[26] N. Trinajstic, “Chemical Graph Theory,” CRC Press,
Boca Raton, 1992.
OJDM