On Ordinary and Weighted Harary Indices of Mycielski Graphs

2nd Reading
February 24, 2017 15:49 WSPC/S1793-8309 257-DMAA 1750022
Discrete Mathematics, Algorithms and Applications

Vol. 9, No. 2 (2017) 1750022 (14 pages)

c World Scientific Publishing Company
DOI: 10.1142/S1793830917500227
On ordinary and weighted Harary indices

of Mycielski graphs
Mahdieh Azari
Department of Mathematics, Kazerun Branch
Discrete Math. Algorithm. Appl. Downloaded from www.worldscientific.com
by UNIVERSITY OF NEW ENGLAND on 03/06/17. For personal use only.
Islamic Azad University

P. O. Box: 73135-168, Kazerun, Iran
azari@kau.ac.ir, mahdie.azari@gmail.com
Received 8 February 2016

Accepted 25 January 2017
Published 28 February 2017
The Mycielski’s construction is a well-known construction on graphs which transforms

a k-chromatic triangle-free graph G into a (k + 1)-chromatic triangle-free graph µ(G)
which is called the Mycielski graph of G. In this paper, we compute the Harary index,
additively weighted Harary index, and multiplicatively weighted Harary index of the
Mycielski graph of any simple connected graph with girth greater than 6.
Keywords: Harary index; additively weighted Harary index; multiplicatively weighted

Harary index; Mycielski graph.
Mathematics Subject Classification: 05C76, 05C12, 05C07
1. Introduction
All graphs considered in this paper will be simple and connected, unless explicitly
stated otherwise. We denote the vertex set and edge set of a graph G by V (G) and
E(G), respectively. The order of a graph is the cardinality of its vertex set and the
size of a graph is the cardinality of its edge set. The degree dG (u) of the vertex u in
a graph G is the number of edges incident to u. A graph in which every vertex has
degree r is called an r-regular graph. The distance dG (u, v) between the vertices u
and v in G is the length of a shortest path in G connecting u and v. The girth of G
is the length of a shortest cycle in G and is denoted by g(G). If G is an acyclic or
a disconnected graph, its girth is defined to be infinity. A graph with girth four or
more is triangle-free. The chromatic number of a graph is the smallest number of
colors needed to color its vertices so that no two adjacent vertices share the same
color. A graph G is said to be k-chromatic if its chromatic number is exactly k.
A graph invariant (also known as topological index ) is a real number related to
a graph which is invariant under graph isomorphism, i.e., it does not depend on
1750022-1
2nd Reading
M. Azari
the labeling or pictorial representation of a graph. There are numerous topologi-

cal indices that have been found to be useful in chemical documentation, isomer
discrimination, quantitative structure-property relationships (QSPR), quantitative
structure-activity relationships (QSAR), and pharmaceutical drug design.
The best known and widely used distance-based topological index is the Wiener
index. This index was introduced in 1947 by Wiener [28] who used it for modeling
the thermodynamic properties of alkanes. The Wiener index of a graph G is defined
as the sum of distances between all unordered pairs of vertices in G,

W (G) = dG (u, v).
{u,v}⊆V (G)
The Zagreb indices are among the oldest vertex-degree-based topological indices,
and were introduced by Gutman and Trinajstić [17] in 1972. These indices have
since been used to study molecular complexity, chirality, ZE-isomerism and hetero-
systems. The first and second Zagreb indices of a graph G are respectively defined as

M1 (G) = dG (u)2 and M2 (G) = dG (u)dG (v).
u∈V (G) uv∈E(G)
An alternative definition of M1 (G) is given by

M1 (G) = (dG (u) + dG (v)).
uv∈E(G)
For details on the theory and applications of Zagreb indices, see [3, 4, 6, 9, 13, 15, 24].
The Harary index of a graph G was independently introduced by Plavšić et al.
[25] and Ivanciuc et al. [20] as the sum of reciprocal distances between all unordered
pairs of vertices in G,
1
H(G) = .
dG (u, v)
{u,v}⊆V (G)
This graph invariant received a lot of attention; see recent papers [5, 22, 27], the
new book [29] and references therein. The Harary index was originally introduced in
mathematical chemistry with a motivation that it would improve the inconsistency
of the Wiener index caused by the fact that the contribution of close pairs of vertices
to the overall value is much smaller than that of distant vertices. Since the Harary
index does not resolve this inconsistency, additional modifications were proposed,
several of them by including vertex degrees.
The additively weighted Harary index HA (G) of G was independently introduced
by Alizadeh et al. [1] and Hua and Zhang [18] as
dG (u) + dG (v)
HA (G) = .
dG (u, v)
{u,v}⊆V (G)
The additively weighted Harary index is also called reciprocal degree distance
because it can be considered as a reciprocal analogue of the degree distance [11, 16]
1750022-2
2nd Reading
On ordinary and weighted Harary indices of Mycielski graphs
of a graph. This invariant can be used as an efficient measuring tool in the study
of complex networks [1].
The multiplicatively weighted Harary index HM (G) of G was introduced by
Alizadeh et al. [1] as
dG (u)dG (v)
HM (G) = .
dG (u, v)
{u,v}⊆V (G)
The multiplicatively weighted Harary index is also called the reciprocal product-
degree distance. For some newest results on HA and HM , see [2, 10, 26, 30].
In a search for triangle-free graphs with arbitrarily large chromatic numbers,
Mycielski [23] developed an interesting graph transformation as follows. Let G be a

simple graph with vertex set V (G) = {v1 , v2 , . . . , vn }. The Mycielskian or Mycielski
graph µ(G) of G contains G itself as an isomorphic subgraph, together with n + 1
additional vertices; a vertex ui corresponding to each vertex vi of G, and another
vertex w. Each vertex ui is connected by an edge to w, so that these vertices form
a subgraph in the form of a star K1,n . In addition, for each edge vi vj of G, the
Mycielski graph µ(G) includes two edges, ui vj and vi uj . Mycielski [23] proved that
if G is a k-chromatic triangle-free graph, µ(G) is a (k + 1)-chromatic triangle-
free graph. Many graphs of general, and in particular of chemical interest, can be
considered as the Mycielski graph µ(G) of a graph G. The Mycielski graph µ(G)
has a more complicated structure than the graph G. So, in general, computing
its topological invariants is more difficult than computing topological invariants of
the graph G. It is, hence, important to understand how certain invariants of the
Mycielski graph µ(G) are related to the invariants of the graph G. The Mycielskian
and generalized Mycielskians have fascinated graph theorists a great deal. This has
resulted in studying several graph parameters of these graphs [7, 12, 21], and also
in computing some of their topological indices [8, 14, 19]. In this paper, we continue
this line of research by computing the Harary index, additively weighted Harary
index, and multiplicatively weighted Harary index of the Mycielski graph of any
simple connected graph with girth greater than 6.
2. Preliminaries
In this section, we define some notations and state some lemmas used in the proof
of our results.
We start with the following well-known lemma. For its proof, see for example [14].
Lemma 2.1. Let G be a graph of size m.
(i) The number of paths of length two in G is equal to 12 M1 (G) − m.

(ii) If G is a triangle-free graph, the number of paths of length three in G is equal
to M2 (G) − M1 (G) + m.
1750022-3
2nd Reading
M. Azari
Let G be a graph of order n and size m, and let V (G) = {v1 , v2 , . . . , vn }. We

define the sets A1 (G), A2 (G), A3 (G), and A(G) as follows:
Ak (G) = {{i, j} ⊆ {1, 2, . . . , n} : dG (vi , vj ) = k}, 1 ≤ k ≤ 3,
A(G) = {{i, j} ⊆ {1, 2, . . . , n} : dG (vi , vj ) ≥ 4}.
Obviously,
|A1 (G)| = m. (2.1)
If the girth of G is greater than 4, part (i) of Lemma 2.1 yields
1
|A2 (G)| =
M1 (G) − m, (2.2)
2
and if the girth of G is greater than 6, part (ii) of Lemma 2.1 yields
|A3 (G)| = M2 (G) − M1 (G) + m. (2.3)
It is easy to see that
n(n − 1)
|A(G)| = − |A1 (G)| − |A2 (G)| − |A3 (G)|.
2
So if the girth of G is greater than 6, by Eqs. (2.1)–(2.3), we obtain
n(n − 1) 1
|A(G)| = − m + M1 (G) − M2 (G). (2.4)
2 2
For 1 ≤ k ≤ 3, we define
(k)

M1 (G) = (dG (vi ) + dG (vj )),
{i,j}∈Ak (G)
(k)

M2 (G) = dG (vi )dG (vj ).
{i,j}∈Ak (G)
Obviously,
(1) (1)
M1 (G) = M1 (G) and M2 (G) = M2 (G).
nr
Also, if G is an r-regular graph with girth greater than 6, then |Ak (G)| = 2 (r −
1)k−1 , 1 ≤ k ≤ 3. Hence,
(k) (k) nr3
M1 (G) = nr2 (r − 1)k−1 and M2 (G) = (r − 1)k−1 , 1 ≤ k ≤ 3.
2
(2.5)
Lemma 2.2. Let G be a graph of order n and size m and let V (G) = {v1 , v2 , . . . ,
vn }. Then

(dG (vi ) + dG (vj )) = 2m(n − 1), (2.6)
1≤i<j≤n
(2) (3)
(dG (vi ) + dG (vj )) = 2m(n − 1) − M1 (G) − M1 (G) − M1 (G). (2.7)
{i,j}∈A(G)
1750022-4
2nd Reading
Proof. It is easy to see that for each 1 ≤ i ≤ n, dG (vi ) is computed n − 1 times in

the first sum. So
n

(dG (vi ) + dG (vj )) = (n − 1)dG (vi ) = 2m(n − 1),
1≤i<j≤n i=1
and Eq. (2.6) is attained. Using the definition of the set A(G) and Eq. (2.6), we
easily arrive at Eq. (2.7).
Lemma 2.3. Let G be a graph of order n and size m and let V (G) = {v1 , v2 , . . . ,
vn }. Then

1
dG (vi )dG (vj ) = 2m2 − M1 (G), (2.8)
2
1≤i<j≤n
1 (2) (3)
dG (vi )dG (vj ) = 2m2 − M1 (G) − M2 (G) − M2 (G) − M2 (G). (2.9)
2
{i,j}∈A(G)
Proof. The first sum is equal to

 
n
n n
1
dG (vi )dG (vj ) =  dG (vi )dG (vj ) − dG (vi )2 
2 i=1 j=1 i=1
1≤i<j≤n
 
n n n
1 
= dG (vi ) dG (vj ) − dG (vi )2 
2 i=1 j=1 i=1
1
= 2m2 − M1 (G),
2
and Eq. (2.8) is attained. Using the definition of the set A(G) and Eq. (2.8), we
easily arrive at Eq. (2.9).
3. Results and Discussion

In this section, we state and prove our main results by giving explicit formulae
for the ordinary and weighted Harary indices of the Mycielski graph of any simple
connected graph with girth greater than 6. Throughout this section, let G be a
simple connected graph with vertex set V (G) = {v1 , v2 , . . . , vn } and edge set E(G).
Also, let µ(G) denote the Mycielski graph of G with vertex set
V (µ(G)) = V (G) ∪ U ∪ {w},
and edge set
E(µ(G)) = E(G) ∪ {vi uj : vi vj ∈ E(G)} ∪ {wui : 1 ≤ i ≤ n},
1750022-5
2nd Reading
M. Azari
where U = {u1 , u2 , . . . , un }, V (G) ∩ U = φ, and w is a new vertex with the property

w∈ / V (G) ∪ U which is connected to each vertex ui , 1 ≤ i ≤ n.
In the following lemmas, the degree of an arbitrary vertex of µ(G) and the
distance between any two vertices of this graph are determined. The results follow
immediately from the definition of µ(G), and their proofs are therefore omitted.
Lemma 3.1. For each u ∈ V (µ(G)), we have



dG (vi ) if u = vi ,
dµ(G) (u) = dG (vi ) + 1 if u = ui ,


n if u = w.
Lemma 3.2. Let G be a triangle-free graph. For each u, v ∈ V (µ(G)), we have


 dG (vi , vj ) if u = vi , v = vj , dG (vi , vj ) ≤ 3,



 if u = vi , v = vj , dG (vi , vj ) ≥ 4,

 4



 2 if u = ui , v = uj , i = j,



2 if u = vi , v = ui ,
dµ(G) (u, v) =

 dG (vi , vj ) if u = vi , v = uj , i = j, dG (vi , vj ) ≤ 2,





 3 if u = vi , v = uj , i = j, dG (vi , vj ) ≥ 3,






2 if u = vi , v = w,

1 if u = ui , v = w.
In the following theorem, the Harary index of µ(G) is computed.
Theorem 3.3. Let G be a graph of order n and size m with girth greater than 6.
Then
1
H(µ(G)) = [5M1 (G) + 2M2 (G) + 17n2 + 31n + 38m]. (3.1)
24
Proof. By definition of the Harary index,
1
H(µ(G)) = .
dµ(G) (u, v)
{u,v}⊆V (µ(G))
From the definition of µ(G), V (µ(G)) = V (G) ∪ U ∪ {w}. So for each {u, v} ⊆
V (µ(G)), we have five cases, namely, {u, v} ⊆ V (G); {u, v} ⊆ U ; u ∈ V (G), v ∈ U ;
u ∈ V (G), v = w and u ∈ U , v = w. Hence, the above sum can be partitioned into
five sums as follows:
1750022-6
2nd Reading
The first sum S1 consists of contributions to H(µ(G)) of pairs of vertices from

G. By Lemma 3.2, we obtain
1
S1 =
dµ(G) (vi , vj )
1≤i<j≤n
1 1 1 1
= + + +
1 2 3 4
{i,j}∈A1 (G) {i,j}∈A2 (G) {i,j}∈A3 (G) {i,j}∈A(G)
1 1 1
= |A1 (G)| + |A2 (G)| + |A3 (G)| + |A(G)|.
2 3 4
The second sum S2 consists of contributions to H(µ(G)) of pairs of vertices from
U . By Lemma 3.2,
1 1 n(n − 1)
S2 = = = .
dµ(G) (ui , uj ) 2 4
1≤i<j≤n 1≤i<j≤n
The third sum S3 is taken over all pairs of vertices of µ(G) such that one of
them is in G and the other one is in U . By Lemma 3.2,
n
n n
1 1 1
S3 = = +2
d (v , uj )
i=1 j=1 µ(G) i
d (v , ui )
i=1 µ(G) i
d (vi , uj )
1≤i<j≤n µ(G)
 
n
1 1 1 1
= +2 + + 
i=1
2 1 2 3
{i,j}∈A1 (G) {i,j}∈A2 (G) {i,j}∈A3 (G)∪A(G)
n 2 2
= + 2|A1 (G)| + |A2 (G)| + |A3 (G)| + |A(G)|.
2 3 3
The fourth sum S4 is taken over all pairs of vertices of µ(G) such that one of
them is in G and the other one is w. By Lemma 3.2,
n
1 n
1 n
S4 = = = .
i=1
dµ(G) (vi , w) i=1
2 2
The last sum S5 is taken over all pairs of vertices of µ(G) such that one of them
is in U and the other one is w. By Lemma 3.2,
n
1 n
1
S5 = = = n.
i=1
dµ(G) (ui , w) i=1
1
By adding S1 , S2 , S3 , S4 , and S5 , we obtain
3 11 n(n + 7)
H(µ(G)) = 3|A1 (G)| + |A2 (G)| + |A3 (G)| + |A(G)| + .
2 12 4
1750022-7
2nd Reading
M. Azari
Equation (3.1) is obtained by using Eqs. (2.1)–(2.4) and simplifying the resulting
expression.
Using Theorem 3.3 and Eq. (2.5), we get the following corollary.
Corollary 3.4. Let G be an r-regular graph of order n with girth greater than 6.
Then
n 3
H(µ(G)) = (r + 5r2 + 19r + 17n + 31).
24
In particular for n > 6,
n
H(µ(Cn )) = (17n + 97).
24
In the following theorem, the additively weighted Harary index of µ(G) is com-
puted.
Then
1 (2) (3)
HA (µ(G)) = [22M1(G) + 6M1 (G) + M1 (G) + 24m(n + 1) + 2n(7n + 2)].
6
(3.2)
Proof. By definition of the additively weighted Harary index,

dµ(G) (u) + dµ(G) (v)
HA (µ(G)) = .
dµ(G) (u, v)
{u,v}⊆V (µ(G))
Using the same argument as in the proof of Theorem 3.3, we partition the above
sum into five sums as follows:
The first sum S1 consists of contributions to HA (µ(G)) of pairs of vertices from
G. By Lemmas 3.1 and 3.2, we obtain
dµ(G) (vi ) + dµ(G) (vj )
S1 =
dµ(G) (vi , vj )
1≤i<j≤n
2dG (vi ) + 2dG (vj ) 2dG (vi ) + 2dG (vj )

= +
1 2
{i,j}∈A1 (G) {i,j}∈A2 (G)
2dG (vi ) + 2dG (vj ) 2dG (vi ) + 2dG (vj )

+ + .
3 4
{i,j}∈A3 (G) {i,j}∈A(G)
(k)
Using the definition of M1 (G), 1 ≤ k ≤ 3, and Eq. (2.7), we have
(2) 2 (3)
S1 = 2M1 (G) + M1 (G) + M1 (G)
3
1 (2) (3)
+ [2m(n − 1) − M1 (G) − M1 (G) − M1 (G)]
2
3 1 (2) 1 (3)
= M1 (G) + M1 (G) + M1 (G) + m(n − 1).
2 2 6
1750022-8
2nd Reading
The second sum S2 consists of contributions to HA (µ(G)) of pairs of vertices

from U . By Lemmas 3.1 and 3.2,
dµ(G) (ui ) + dµ(G) (uj ) (dG (vi ) + 1) + (dG (vj ) + 1)
S2 = = .
dµ(G) (ui , uj ) 2
1≤i<j≤n 1≤i<j≤n
Using Eq. (2.6), we get

n(n − 1)
S2 = m(n − 1) + .
2
them is in G and the other one is in U . By Lemmas 3.1 and 3.2,
n n n
dµ(G) (vi ) + dµ(G) (uj ) 2dG (vi ) + (dG (vi ) + 1)
S3 = =
i=1 j=1
dµ(G) (vi , uj ) i=1
2

2dG (vi ) + (dG (vj ) + 1) 2dG (vj ) + (dG (vi ) + 1)
+ +
1 1
{i,j}∈A1 (G)

+ +
2 2
{i,j}∈A2 (G)

+ + .
3 3
{i,j}∈A3 (G)∪A(G)
(k)

n 3 (2)
S3 = 3m + + [3M1 (G) + 2|A1 (G)|] + M1 (G) + |A2 (G)|
2 2

(3) 2
+ M1 (G) + |A3 (G)|
3

(2) (3) 2
+ 2m(n − 1) − M1 (G) − M1 (G) − M1 (G) + |A(G)|
3
1 (2) 2 2
= 2M1 (G) + M1 (G) + 2|A1 (G)| + |A2 (G)| + |A3 (G)| + |A(G)|
2 3 3
n
+ m(2n + 1) + .
2
them is in G and the other one is w. By Lemmas 3.1 and 3.2,
n n
dµ(G) (vi ) + dµ(G) (w) 2dG (vi ) + n n2
S4 = = = 2m + .
i=1
dµ(G) (vi , w) i=1
2 2
is in U and the other one is w. By Lemmas 3.1 and 3.2,
n n
dµ(G) (ui ) + dµ(G) (w) (dG (vi ) + 1) + n
S5 = = = 2m + n(n + 1).
i=1
dµ(G) (ui , w) i=1
1
1750022-9
2nd Reading
M. Azari
By adding S1 , S2 , S3 , S4 , and S5 , we obtain
7 (2) 1 (3)
HA (µ(G)) = M1 (G) + M1 (G) + M1 (G) + 2|A1 (G)| + |A2 (G)|
2 6
2 2
+ |A3 (G)| + |A(G)| + m(4n + 3) + n(2n + 1).
3 3
Equation (3.2) is obtained by using Eqs. (2.1)–(2.4) and simplifying the resulting
expression.
Then
n 2 2
HA (µ(G)) = [r (r + 4r + 17) + 12r(n + 1) + 2(7n + 2)].
6
n
HA (µ(Cn )) = (19n + 72).
3
In the following theorem, the multiplicatively weighted Harary index of µ(G) is

computed.
Then
1 (2) (2)
HM (µ(G)) = [11M1(G) + 4M1 (G) + 68M2 (G) + 20M2 (G)
12
(3)
+ 4M2 (G) + 4m(17m + 19n − 1) + 3n(5n − 1)]. (3.3)
Proof. By definition of the multiplicatively weighted Harary index,
dµ(G) (u)dµ(G) (v)

HM (µ(G)) = .
dµ(G) (u, v)
{u,v}⊆V (µ(G))
In a similar manner as in the proof of Theorems 3.3 and 3.5, the above sum can be
partitioned into the sums S1 , S2 , S3 , S4 , and S5 as follows:
1750022-10
2nd Reading
The first sum S1 consists of contributions to HM (µ(G)) of pairs of vertices from

G. By Lemmas 3.1 and 3.2, we obtain
dµ(G) (vi )dµ(G) (vj )

S1 =
dµ(G) (vi , vj )
1≤i<j≤n
2dG (vi ) × 2dG (vj ) 2dG (vi ) × 2dG (vj )

= +
1 2
{i,j}∈A1 (G) {i,j}∈A2 (G)
2dG (vi ) × 2dG (vj ) 2dG (vi ) × 2dG (vj )

+ + .
3 4
{i,j}∈A3 (G) {i,j}∈A(G)
(k)
(2) 4 (3)
S1 = 4M2 (G) + 2M2 (G) + M2 (G)
3

1 (2) (3)
+ 2m2 − M1 (G) − M2 (G) − M2 (G) − M2 (G)
2
1 (2) 1 (3)
= − M1 (G) + 3M2 (G) + M2 (G) + M2 (G) + 2m2 .
2 3
The second sum S2 consists of contributions to HM (µ(G)) of pairs of vertices

from U . By Lemmas 3.1 and 3.2,
dµ(G) (ui )dµ(G) (uj )

S2 =
dµ(G) (ui , uj )
1≤i<j≤n
(dG (vi ) + 1)(dG (vj ) + 1)

=
2
1≤i<j≤n
1
= [1 + (dG (vi ) + dG (vj )) + dG (vi )dG (vj )].
2
1≤i<j≤n
Using Eqs. (2.6) and (2.8), we get
n(n − 1) 1
S2 = + m(n − 1) + m2 − M1 (G).
4 4
them is in G and the other one is in U . By Lemmas 3.1 and 3.2,
n
n n

dµ(G) (vi )dµ(G) (uj ) 2dG (vi )(dG (vi ) + 1)
S3 = =
i=1 j=1
dµ(G) (vi , uj ) i=1
2
1750022-11
2nd Reading
M. Azari

2dG (vi )(dG (vj ) + 1) 2dG (vj )(dG (vi ) + 1)
+ +
1 1
{i,j}∈A1 (G)

+ +
2 2
{i,j}∈A2 (G)

+ + .
3 3
{i,j}∈A3 (G)∪A(G)
(k) (k)
Using the definition of M1 (G), M2 (G), 1 ≤ k ≤ 3, Eq. (2.7), and Eq. (2.9), we
have
(2) (2)
S3 = [M1 (G) + 2m] + [4M2 (G) + 2M1 (G)] + [2M2 (G) + M1 (G)]
1 (3) (3) 1 (2)
+ [4M2 (G) + 2M1 (G)] + [8m2 − 2M1 (G) − 4M2 (G) − 4M2 (G)
3 3
(3) (2) (3)
− 4M2 (G) + 4m(n − 1) − 2M1 (G) − 2M1 (G) − 2M1 (G)]
5 1 (2) 8 2 (2) 8 2
= M1 (G) + M1 (G) + M2 (G) + M2 (G) + m2 + m(2n + 1).
3 3 3 3 3 3
them is in G and the other one is w. By Lemmas 3.1 and 3.2,
n
n

dµ(G) (vi )dµ(G) (w) 2dG (vi ) × n
S4 = = = 2nm.
i=1
dµ(G) (vi , w) i=1
2
is in U and the other one is w. By Lemmas 3.1 and 3.2,
n
n

dµ(G) (ui )dµ(G) (w) (dG (vi ) + 1)n
S5 = = = 2nm + n2 .
i=1
dµ(G) (ui , w) i=1
1
Adding S1 , S2 , S3 , S4 , and S5 , and simplifying the resulting expression, we get

Eq. (3.3).
Then
n
HM (µ(G)) = [2r3 (r2 + 3r + 15) + r2 (17n + 7) + 2r(19n − 1) + 3(5n − 1)].
12
n
HM (µ(Cn )) = (159n + 421).
12
1750022-12
2nd Reading
Acknowledgments
The author would like to thank the referees for their insightful comments and valu-
able suggestions.
References
[1] Y. Alizadeh, A. Iranmanesh and T. Došlić, Additively weighted Harary index of some
composite graphs, Discrete Math. 313 (2013) 26–34.
[2] M. An and L. Xiong, Multiplicatively Weighted Harary index of some composite
graphs, Filomat 29(4) (2015) 795–805.
[3] M. Azari and A. Iranmanesh, Generalized Zagreb index of graphs, Stud. Univ. Babes-
Bolyai Chem. 56(3) (2011) 59–70.
[4] M. Azari and A. Iranmanesh, Chemical graphs constructed from rooted product and
their Zagreb indices, MATCH Commun. Math. Comput. Chem. 70 (2013) 901–919.
[5] M. Azari and A. Iranmanesh, Harary index of some nano-structures, MATCH Com-
mun. Math. Comput. Chem. 71 (2014) 373–382.
[6] M. Azari, A. Iranmanesh and I. Gutman, Zagreb indices of bridge and chain graphs,
MATCH Commun. Math. Comput. Chem. 70 (2013) 921–938.
[7] R. Balakrishnan, T. Kavaskar and W. So, The energy of the Mycielskian of a regular
graph, Australas. J. Combin. 52 (2012) 163–171.
[8] A. Behtoie and M. Anbarloie, Degree distance index of the Mycielskian and its com-
plement, Iranian J. Math. Chem. 7(1) (2016) 1–9.
[9] N. De, Some bounds of reformulated Zagreb indices, Appl. Math. Sci. 6 (2012) 5005–
5012.
[10] H. Deng, B. Krishnakumari, Y. B. Venkatakrishnan and S. Balachandran, Multi-
plicatively weighted Harary index of graphs, J. Comb. Optim. 30(4) (2015) 1125–
1137.
[11] A. A. Dobrynin and A. A. Kochetova, Degree distance of a graph: A degree analogue
of the Wiener index, J. Chem. Inf. Comput. Sci. 34 (1994) 1082–1086.
[12] T. Došlić, Mycielskians and matchings, Discuss. Math. Graph Theory 25(3) (2005)
261–266.
[13] T. Došlić, On discriminativity of Zagreb indices, Iranian J. Math. Chem. 3(1) (2012)
25–34.
[14] M. Eliasi, G. Raeisi and B. Taeri, Wiener index of some graph operations, Discrete
Appl. Math. 160 (2012) 1333–1344.
[15] F. Falahati-Nezhad, A. Iranmanesh, A. Tehranian and M. Azari, Comparing the
second multiplicative Zagreb coindex with some graph invariants, Trans. Comb. 3(4)
(2014) 31–41.
[16] I. Gutman, Selected properties of the Schultz molecular topological index, J. Chem.
Inf. Comput. Sci. 34 (1994) 1087–1089.
[17] I. Gutman and N. Trinajstić, Graph theory and molecular orbitals, Total π-electron
energy of alternant hydrocarbons, Chem. Phys. Lett. 17 (1972) 535–538.
[18] H. Hua and S. Zhang, On the reciprocal degree distance of graphs, Discrete Appl.
Math. 160 (2012) 1152–1163.
[19] H. Hua, A. R. Ashrafi and L. Zhang, More on Zagreb coindices of graphs, Filomat
26 (2012) 1215–1225.
[20] O. Ivanciuc, T. S. Balaban and A. T. Balaban, Design of topological indices. Part
4. Reciprocal distance matrix, related local vertex invariants and topological indices,
J. Math. Chem. 12 (1993) 309–318.
1750022-13
2nd Reading
M. Azari
[21] W. Liu, J. Wu, P. C. B. Lam and G. Gu, Several parameters of generalized Myciel-
skians, Discrete Appl. Math. 154 (2006) 1173–1182.
[22] B. Lučić, A. Miličević, S. Nikolić and N. Trinajstić, Harary index-twelve years later,
Croat. Chem. Acta, 75 (2002) 847–868.
[23] J. Mycielski, Sur le colouriage des graphes, Colloq. Math. 3 (1955) 161–162.
[24] S. Nikolić, G. Kovačević, A. Miličević and N. Trinajstić, The Zagreb indices 30 years
after, Croat. Chem. Acta 76 (2003) 113–124.
[25] D. Plavšić, S. Nikolić and N. Trinajstić, On the Harary index for the characterization
of chemical graphs, J. Math. Chem. 12 (1993) 235–250.
[26] J. Sedlar, Extremal unicyclic graphs with respect to additively weighted Harary index,
Miskolc. Math. Notes 16(2) (2015) 1163–1180.
[27] G. Su, L. Xiong and I. Gutman, Harary index of the k th power of a graph, Appl.
Anal. Discrete Math. 7 (2013) 94–105.
[28] H. Wiener, Structural determination of paraffin boiling points, J. Am. Chem. Soc.
69(1) (1947) 17–20.
[29] K. Xu, K. C. Das and N. Trinajstić, The Harary Index of a Graph (Springer, Heidel-
berg 2015).
[30] K. Xu, J. Wang, K. C. Das and S. Klavžar, Weighted Harary indices of apex trees
and k -apex trees, Discrete Appl. Math. 189(10) (2015) 30–40.
1750022-14

On Ordinary and Weighted Harary Indices of Mycielski Graphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

On Ordinary and Weighted Harary Indices of Mycielski Graphs

Uploaded by

Copyright:

Available Formats

2nd Reading

February 24, 2017 15:49 WSPC/S1793-8309 257-DMAA 1750022

Discrete Mathematics, Algorithms and Applications

On ordinary and weighted Harary indices

Islamic Azad University

Received 8 February 2016

The Mycielski’s construction is a well-known construction on graphs which transforms

Keywords: Harary index; additively weighted Harary index; multiplicatively weighted

Mathematics Subject Classification: 05C76, 05C12, 05C07

the labeling or pictorial representation of a graph. There are numerous topologi-

An alternative deﬁnition of M1 (G) is given by

On ordinary and weighted Harary indices of Mycielski graphs

Mycielski [23] developed an interesting graph transformation as follows. Let G be a

Lemma 2.1. Let G be a graph of size m.

(i) The number of paths of length two in G is equal to 12 M1 (G) − m.

Let G be a graph of order n and size m, and let V (G) = {v1 , v2 , . . . , vn }. We

On ordinary and weighted Harary indices of Mycielski graphs

Proof. It is easy to see that for each 1 ≤ i ≤ n, dG (vi ) is computed n − 1 times in

Proof. The ﬁrst sum is equal to

3. Results and Discussion

V (µ(G)) = V (G) ∪ U ∪ {w},

and edge set

E(µ(G)) = E(G) ∪ {vi uj : vi vj ∈ E(G)} ∪ {wui : 1 ≤ i ≤ n},

where U = {u1 , u2 , . . . , un }, V (G) ∩ U = φ, and w is a new vertex with the property

Lemma 3.1. For each u ∈ V (µ(G)), we have

Lemma 3.2. Let G be a triangle-free graph. For each u, v ∈ V (µ(G)), we have

In the following theorem, the Harary index of µ(G) is computed.

Proof. By deﬁnition of the Harary index,

On ordinary and weighted Harary indices of Mycielski graphs

The ﬁrst sum S1 consists of contributions to H(µ(G)) of pairs of vertices from

By adding S1 , S2 , S3 , S4 , and S5 , we obtain

Proof. By deﬁnition of the additively weighted Harary index,

2dG (vi ) + 2dG (vj ) 2dG (vi ) + 2dG (vj )

2dG (vi ) + 2dG (vj ) 2dG (vi ) + 2dG (vj )

On ordinary and weighted Harary indices of Mycielski graphs

The second sum S2 consists of contributions to HA (µ(G)) of pairs of vertices

Using Eq. (2.6), we get

By adding S1 , S2 , S3 , S4 , and S5 , we obtain

In particular for n > 6,

In the following theorem, the multiplicatively weighted Harary index of µ(G) is

Proof. By deﬁnition of the multiplicatively weighted Harary index,

dµ(G) (u)dµ(G) (v)

On ordinary and weighted Harary indices of Mycielski graphs

The ﬁrst sum S1 consists of contributions to HM (µ(G)) of pairs of vertices from

dµ(G) (vi )dµ(G) (vj )

2dG (vi ) × 2dG (vj ) 2dG (vi ) × 2dG (vj )

2dG (vi ) × 2dG (vj ) 2dG (vi ) × 2dG (vj )

The second sum S2 consists of contributions to HM (µ(G)) of pairs of vertices

dµ(G) (ui )dµ(G) (uj )

(dG (vi ) + 1)(dG (vj ) + 1)

Using Eqs. (2.6) and (2.8), we get

Adding S1 , S2 , S3 , S4 , and S5 , and simplifying the resulting expression, we get

On ordinary and weighted Harary indices of Mycielski graphs

You might also like