International Journal of Advanced Research in Engineering and Technology

(IJARET)
Volume 7, Issue 3, MayJune 2016, pp. 2541, Article ID: IJARET_07_03_003
Available online at
http://www.iaeme.com/IJARET/issues.asp?JType=IJARET&VType=7&IType=3
ISSN Print: 0976-6480 and ISSN Online: 0976-6499
IAEME Publication

ZAGREB INDICES AND ZAGREB

COINDICES OF SOME GRAPH
OPERATIONS
K. Kiruthika
Assistant Professor, Mathematics,
Sri Shanmugha College of Engineering and Technology,
Salem [Dt] TamilNadu, India.
ABSTRACT
A topological index is the graph invariant numerical descriptor calculated
from a molecular graph representing a molecule. Classical Zagreb indices
and the recently introduced Zagreb coindices are topological indices related
to the atom atom connectivity of the molecular structure represented by the
graph G. We explore here their basic mathematical properties and present
explicit formulae for these new graph invariants under several graph
operations.
Key words: Topological Index, Zagreb Indices and Zagreb Coindices, Graph
Operations.
Cite this article: K. Kiruthika. Zagreb Indices and Zagreb Coindices of Some
Graph Operations. International Journal of Advanced Research in
Engineering and Technology, 7(3), 2016, pp 2541
http://www.iaeme.com/IJARET/issues.asp?JType=IJARET&VType=7&IType=3

1. INTRODUCTION
A representation of an object giving information only about the number of elements
composing it and their connectivity is named as topological representation of an
object. A topological representation of a molecule is called molecular graph. A
molecular graph is a collection of points representing the atoms in the molecule and
set of lines representing the covalent bonds. These points are named vertices and the
lines are named edges in graph theory language. The advantage of topological
indices is in that they may be used directly as simple numerical descriptors in a
comparison with physical, chemical or biological parameters of molecules in
Quantitative Structure Property Relationships (QSPR) and in Quantitative Structure
Activity Relationships (QSAR).
The first and second Zagreb indices [6] which are dependent on the degrees of
adjacent vertices appeared in the topological formula for the -electron energy of

http://www.iaeme.com/IJARET/index.asp

25

editor@iaeme.com

K. Kiruthika

conjugated systems, were first introduced by Gutman and Trinajstic (1983). The
Zagreb indices are found to have applications in QSPR and QSAR studies. Recently,
the first and second Zagreb coindices [1], a new pair of invariants, were introduced in
Doslic which are dependent on the degrees of non-adjacent vertices and thereby
quantifying a possible influence of remote pairs of vertices to the molecules
properties. Note that the Zagreb coindices of G are not agre indices of
hile the
defining sums are over the set of edges of , the degrees are still with respect to G.

2. ZAGREB INDICES AND ZAGRED COINDICES

ll graphs considered are finite and simple et
e a finite simple graph on n
vertices and m edges e denote the verte set and the edge set
and
respectivel
oslic
he complement of denoted
, is a simple graph on
the same set of vertices V(G) in which two vertices u and v are adjacent. (i.e)
connected by an edge uv, iff they are not adjacent in G. Hence

uv E(G) uv E(G) .

E(G) E(G) E( Kn )

Obviously,

and

n
m E (G ) m .The degree of a vertex u in G is denoted by dG (u) the degree
2
dG (u) n 1 dG (u) .The sum of the degrees
of the same verte in is then given
of vertices of a graph G is twice the number of edges. (i.e)

uV ( G )

dG (u) 2m .

2.1. ZAGREB INDICES

The First Zagreb Index of G [5] is denoted by

M1 (G)

uV ( G )

(u )

M1 (G) and is defined as

The first Zagreb index can also be expressed as a sum over edges in G.

M1 (G)

uvE ( G )

(u) dG (v)

The Second Zagreb Index of G is denoted by

M 2 (G)

uvE ( G )

M 2 (G) and is defined as

dG (u)dG (v)

http://www.iaeme.com/IJARET/index.asp

26

editor@iaeme.com

Zagreb Indices and Zagreb Coindices of Some Graph Operations

Example1
Chemical compound: Methylcyclopropane

Figure 1

Here v1, v2 , v3 , v4 represents the labeling of the graph G, while the underlined
numbers stand for the valencies of the vertices in G.

M1(G) 12 32 22 22 18

M 2 (G) 1.3 3.2 3.2 2.2 19

2.2 ZAGREB COINDICES
The First Zagreb Coindex[1]of G is denoted by

M 1 (G)

uvE ( G )

M 1(G) and is defined as

(u) dG (v)

The Second Zagreb Coindex of G is denoted by

http://www.iaeme.com/IJARET/index.asp

27

M 2 (G) and is defined as

editor@iaeme.com

K. Kiruthika

M 2 (G)

uvE ( G )

dG (u)dG (v)

EXAMPLE 2
Chemical compound: Methylcyclopentane

Figure 2
Here

E(G) = {v1v5, v1v6, v1v3, v1v4, v2v5, v2v6, v3v4, v3v6, v4v5}

M 1(G) = 34 and M 2 (G) = 32

3 BASIC PROPERTIES OF ZAGREB COINDICES
Proposition 1
Let G be a simple graph [4] on n vertices and m edges. Then

M1(G) M1(G) 2(n 1)(m m) .

http://www.iaeme.com/IJARET/index.asp

28

editor@iaeme.com

Zagreb Indices and Zagreb Coindices of Some Graph Operations

Proof
M1 (G)
We know that

M1 (G )

uV ( G )

n 1

uV ( G )

dG (u)2

n 1 d

dG (u)2 = uV (G )

2(n 1)

uV ( G )

uV ( G )

(u )

d G (u )

uV ( G )

d G (u )

n(n 1)2 4m(n 1) M1(G)

M1 (G) = 2(n 1)(m m) M1(G)
Proposition2
Let G be a simple graph on n vertices and m edges. Then M1 (G) 2m(n 1) M1(G) .

Proof
M 1 (G)
The First Zagreb Coindex of G is

n 1 dG (u) n 1 dG (v)

2(n 1) (dG (u) dG (v))

uvE ( G )

uvE ( G )

uvE ( G )

(u) dG (v)

2m(n 1) M 1(G)

2(n 1) m dG (u)2
2
uV (G )
n

2
2(n 1) m (n 1 dG (u)
2
uV (G )

n(n 1)

2(n 1)
m (n 1)2 2(n 1) dG (u) dG (u)2
2
uV (G )
uV (G )
uV (G )

n(n 1)2 2m(n 1) n(n 1)2 4m(n 1) M1(G)

M1(G) 2m(n 1) M1(G)
Proposition 3
Let

be

simple

graph

on

M 2 (G) M 2 (G) (n 1)M1(G) m(n 1)

http://www.iaeme.com/IJARET/index.asp

vertices

and

edges.

Then

29

editor@iaeme.com

K. Kiruthika

Proof

The Second Zagreb Coindex is M 2 (G)

uvE ( G )

(n 1) d

uvE ( G )

(n 1)

dG (u)dG (v)

(u) (n 1) dG (v)

(n 1)

uvE ( G )

d G (u) d G ( v )

uvE ( G )

( u)d G ( v )

uvE ( G )

M 2 (G) M 2 (G) (n 1)M1(G) m(n 1)

Proposition 4
Let G be a simple graph on n vertices and m edges. Then M1 (G) M 1 (G) .

Proof
By applying proposition 2 to G , we get

M1(G) 2m(n 1) M1(G)

Now, plugging in the expression for M1 (G) from proposition 1 yields

M1(G) 2m(n 1) M1(G) 2(n 1)(m m)

2m(n 1) M1 (G)
M1 (G) M 1 (G) .
Proposition 5
Let

be

simple graph
1
M 2 (G) 2m M 2 (G) M1 (G) .
2

on

vertices

and

edges.

Then

Proof
The result follows by squaring both sides of the identity

uV ( G )

Splitting the term 2

dG (u) 2m and then

(u)dG (v) into two sums, one over the edges of G and the

other over the edges of G (Gutman 2004).

uV ( G )

d G (u ) 2 2

uvE ( G )

uvE ( G )

d G (u)d G (u) 2

dG (u)dG (u) 4m
2

uvE ( G )

dG (u)dG (u) 2m2

uV ( G )

uvE ( G )

d G (u)d G (u) 4m 2

d G (u ) 2 2

uvE ( G )

d G (u)d G (u)

1
d G (u) 2 d G (u)d G (u)

2 uV (G )
uvE ( G )

http://www.iaeme.com/IJARET/index.asp

30

editor@iaeme.com

Zagreb Indices and Zagreb Coindices of Some Graph Operations

1
M 2 (G) 2m2 M1 (G) M 2 (G)
2

4. MAIN RESULTS
In this section weintroduce the Zagreb indices and coindicesof Cartesian product,
Disjunction, Composition, Tensor product and Normal product of graphs. All
considered operations are binary. Hence, we usually deal with two finite and simple

G1 and G2 . For a given graph Gi , its vertex set and edge set will be denoted by
Vi and Ei respectively, where i = 1, 2. The number of edges in Gi is denoted by mi

graphs,

.When more than two graphs can be combined using a given operation, the values of
subscripts will vary accordingly.

4.1 CARTESIAN PRODUCT

G2 , (Ashrafi 2009) Cartesian product of G1 G2 is the graph

V V
(u , v ) (u , v )
u u2 and v1 is
on the vertex sets 1 2 and 1 1 and 2 2 are adjacent iff 1
v
u
u
v v2 . The degree of a vertex (u1, v1 ) of
adjacent to 2 or 1 is adjacent to 2 and 1
For given graphs G1 and

G1 G2 is given by d (u , v ) d (u ) d (v ) .
G1G2 1 1
G1 1
G2 1

4.2 DISJUNCTION
The disjunction G1 G2 of two graphs

G1 and G2 is the graph [2] with the vertex sets

V1 V2 and (u1, v1 ) and (u2 , v2 ) are adjacent iff u1 is adjacent to u2 or v1 is adjacent to
v2 . The degree of a vertex (u1, v1 ) of G1 G2 is given by
dG1G2 (u1, v1) n2dG1 (u1) n1dG2 (v1) dG1 (u1)dG2 (v1)

4.3 COMPOSITION
The composition G1

G2

G1 and G2 is the graph with the vertex sets

V1 V2 and (u1, v1 ) and (u2 , v2 ) are adjacent iff [ u1 is adjacent to u2 ] or [ u1 u2 and
v1 is adjacent to v2 ]. The degree of a vertex (u1, v1 ) of G1 G2 is given by
of two graphs

dG1G2 (u1, v1 ) n2dG1 (u1 ) dG2 (v1 ) .

4.4 TENSOR PRODUCT

G1 (V1, E1 ) and G2 (V2 , E2 ) be twographs whose vertex sets are disjoint as also
their edge sets (Parthasarathy 1994) [7]. The tensor product G G1 G2 of graphs G1
and G2 has as its vertex set V1 V2 and (u1, v1 ) and (u2 , v2 ) are adjacent iff u1 is
Let

http://www.iaeme.com/IJARET/index.asp

31

editor@iaeme.com

K. Kiruthika

u2 and v1 is adjacent to v2 . The degree of a vertex (ui , v j ) of G1 G2 is

given by dG1G2 (ui , v j ) dG1 (ui )dG2 (v j ) .
adjacent to

4.5 NORMAL PRODUCT

The normal product G G1

G2 (strong product or wreath product) of two graphs

G1 and G2 (BaskarBabujee 2012) has as its vertex set V1 V2 and (u1, v1 ) and
(u2 , v2 ) are adjacent iff u1 is adjacent to u2 and v1 v2 or
u1 u2 and v1 is adjacent to v2 or
u1 is adjacent to u2 and v1 is adjacent to v2 .The degree of a vertex (ui , v j ) of
G1 G2 is given by dG G (ui , v j ) dG (ui ) dG (v j ) dG (ui )dG (v j ) .
1

All graphs are finite and simple. We denote the vertex and edge sets of G by V(G)
and E(G) respectively. The number of vertices and edges of G by V (G) n and

E(G) m respectively. It can be easily seen that

V (G1 G2 ) V (G1 G2 ) V (G1 G2 )
V (G1 G2 ) V (G1 G2 ) V (G1 ) V (G2 )
LEMMA 6 If G1 and G2 are two simple graphs then,

E(G1 G2 ) V (G2 ) E(G1 ) V (G1 ) E(G2 )

E(G1 G2 ) V (G2 ) E(G1 ) V (G1 ) E(G2 ) 2 E(G1) E(G2 )
2

E(G1 G2 ) V (G2 ) E(G1 ) V (G1 ) E(G2 )

2

E(G1 G2 ) 2 E(G1 ) E(G2 )

E(G1 G2 ) 2 E(G1 ) E(G2 ) V (G2 ) E(G1) V (G1) E(G2 )
PROOF
The part (a-e) are consequence of definitions and some wellknown results of the book
of Imrich and Klavzar [3].

ZAGREB TYPE INDICES FOR CARTESIAN PRODUCT OF GRAPHS

THEOREM 7
The First Zagreb index of Cartesian product of two graphs

G1 and G2 is

M1 (G1 G2 ) n2 M1 (G1 ) n1M1 (G2 ) 8m1m2

http://www.iaeme.com/IJARET/index.asp

32

editor@iaeme.com

Zagreb Indices and Zagreb Coindices of Some Graph Operations

PROOF
n1

M1 (G1 G2 )

n2

dG1G2 (ui , v j )

i 1 j 1

Using the definition of Cartesian product, we get

n1

n2

dG1 (ui ) dG2 (v j )

i 1 j 1

n1

n2

dG1 (ui )2 dG2 (v j )2 2dG1 (ui )dG2 (v j )

i 1 j 1
n1

n2

n1

n2

n1

n2

i 1

j 1

dG1 (ui )2 dG2 (v j )2 2 dG1 (ui ) dG2 (v j )

i 1 j 1

i 1 j 1

n2 M1 (G1 ) n1M1 (G2 ) 8m1m2

THEOREM 8
The First Zagreb coindex of cartesian product of two graphs

G1 and G2 is

M1(G1 G2 ) 2n1n2 m1(n2 1) m2 (n1 1) 8m1m2 n2 M1(G1 ) n1 M 2 (G2 ) .

PROOF: By Lemma (6-a) and Theorem 7,
Using the property

M1(G) 2m(n 1) M1(G)

M1 (G) 2 E (G) ( V (G) 1) M1 (G)

M1(G1 G2 ) 2 E(G1 G2 ) V (G1 G2 ) 1 M1(G1 G2 )

2 n2m1 n1m2 (n1n2 1) M1 (G1 G2 )

2(n1m2 n2m1 )(n1n2 1) 8m1m2 n2 M1 (G1 ) n1M1(G2 )

2(n1n2 1)(n2 m1 n1m2 ) 8m1m2 n2 2m1 (n1 1) M1 (G1 ) n1 2m2 (n2 1) M1 (G2 )
2n1n2 (n2m1 n1m2 ) 2(n2m1 n1m2 ) 8m1m2 2m1n1n2
2m1n2 n2 M1 (G1 ) 2n1n2m2 2m2n1 n1 M1 (G2 )

M1(G1 G2 ) 2n1n2 m1(n2 1) m2 (n1 1) 8m1m2 n2 M1(G1 ) n1 M 2 (G2 ) .

http://www.iaeme.com/IJARET/index.asp

33

editor@iaeme.com

K. Kiruthika

ZAGREB TYPE INDICES FOR DISJUNCTION OF GRAPHS

THEOREM 9
The First Zagreb index of disjunction of two graphs

G1 and G2 is

M1(G1 G2 ) (n22 4m2 )n2M1(G1) (n12 4m1)n1M1(G2 ) 8m1m2n1n2 M1(G1)M1(G2 )

PROOF:

Using the definition of disjunction, we get

n1

M1 (G1 G2 )
n1

n2

n1

n2

n2

dG1 G2 (ui , v j )

i 1 j 1

n2dG1 (ui ) n1dG2 (v j ) dG1 (ui )dG2 (v j )

i 1 j 1

n2dG1 (ui ) n1dG2 (v j ) dG1 (ui )dG2 (v j )

i 1 j 1

2 n2dG1 (ui ) n1dG2 (v j ) dG1 (ui )dG2 (v j )

n1

n2

n1

n2

n1

n2

i 1

j 1

n2 2dG1 (ui )2 n12dG2 (v j )2 2n1n2 dG1 (ui ) d G2 (v j )

i 1 j 1

n1

dG1 (ui )
i 1

i 1 j 1

n2

d
j 1

G2

n1

(v j ) 2n2 dG1 (ui )

2

i 1

n2

d
j 1

G2

n1

n2

i 1

j 1

(v j ) 2n1 dG1 (ui ) dG2 (v j )2

n23M1(G1) n13M1(G2 ) 2n1n2 (2m1)(2m2 ) M1(G1)M1(G2 )

2n2 M1(G1 )(2m2 ) 2n1(2m1 ) M1(G2 )

M1(G1 G2 ) (n22 4m2 )n2M1(G1) (n12 4m1)n1M1(G2 ) 8m1m2n1n2 M1(G1)M1(G2 )
THEOREM 10
The First Zagreb coindex of disjunction of two graphs

G1 and G2 is

M1(G1 G2 ) 2m1n22 (n2 1) 2m2n12 (n1 1) 4m1m2 (n1 n2 )

n23 2m2n2 2m2 M1(G1 ) n13 2m1n1 2m1 M1(G2 )

M1 (G1 ) M1(G2 )

PROOF: By Lemma (6-b) and Theorem 9,

Using the property

M1(G) 2m(n 1) M1(G)

M1 (G) 2 E (G) ( V (G) 1) M1 (G)

http://www.iaeme.com/IJARET/index.asp

34

editor@iaeme.com

Zagreb Indices and Zagreb Coindices of Some Graph Operations

M1(G1 G2 ) 2 E(G1 G2 ) V (G1 G2 ) 1 M1(G1 G2 )

2 n22m1 n12m2 2m1m2 (n1n2 1) M1(G1 G2 )

2n1n23m1 2n13n2m2 4m1m2n1n2 2m1n22 2m2n12 4m1m2

(n22 4m2 )n 2 M1(G1) (n12 4m1)n1 M1(G2 ) 8m1m2n1n 2 M1(G1)M1(G2 )
4m1m2 12m1m2n1n2 2n1n23m1 2n13n2m2 2n22m1 2n12m2
(4m2n2 n23 ) 2m1 (n1 1) M1 (G1 ) (4m1n1 n13 ) 2m2 (n2 1) M1 (G2 )
2m1 (n1 1) M1 (G1 ) 2m2 (n2 1) M1 (G2 )

M1(G1 G2 ) 2m1n22 (n2 1) 2m2n12 (n1 1) 4m1m2 (n1 n2 )

n23 2m2n2 2m2 M1(G1 ) n13 2m1n1 2m1 M1(G2 )

M1 (G1 ) M1(G2 )

ZAGREB TYPE INDICES FOR COMPOSITION OF GRAPHS

THEOREM 11
The First Zagreb index of composition of two graphs

G1 and G2 is

M1(G1 G2 ) n23M1(G1) n1M1(G2 ) 8n2m1m2

PROOF:
Using the definition of Composition, we get
n1

M1(G1 G2 )
n1

n2

n1

n2

dG1G2 (ui , v j ) n2dG1 (ui ) dG2 (v j )

i 1 j 1

i 1 j 1

n2

n2dG1 (ui )2 dG2 (v j )2 2n2dG1 (ui )dG2 (v j )

i 1 j 1
n1

n2

n1

n2

n1

n2

i 1

j 1

n2dG1 (ui ) dG2 (v j ) 2n2 dG1 (ui ) dG2 (v j )

2

i 1 j 1

i 1 j 1

M1(G1 G2 ) n23M1(G1) n1M1(G2 ) 8n2m1m2

THEOREM 12
The First Zagreb coindex of composition of two graphs

G1 and G2 is

M1(G1 G2 ) 2n1n2m2 (n1 1) 2n22m1(n2 1) 8n2m1m2 n23 M1(G1 ) n1 M1(G2 )

PROOF: By Lemma (6 c) and Theorem 11,
http://www.iaeme.com/IJARET/index.asp

35

editor@iaeme.com

K. Kiruthika

Using the property

M1(G) 2m(n 1) M1(G)

M1 (G) 2 E (G) ( V (G) 1) M1 (G)

M1(G1 G2 ) 2 E(G1 G2 ) V (G1 G2 ) 1 M1(G1 G2 )

2 n22m1 n1m2 (n1n2 1) M1(G1 G2 )

2n1n2 (n1m2 n22m1) 2(n1m2 n22m1) 8n2m1m2 n23M1(G1 ) n1M1(G2 )

2n1n2 (n1m2 n22m1) 2(m1n22 n1m2 ) 8n2m1m2
n23 2m1 (n1 1) M1 (G1 ) n1 2m2 (n2 1) M1 (G2 )

From the above, after simple calculations, the desired results follows

M1(G1 G2 ) 2n1n2m2 (n1 1) 2n22m1(n2 1) 8n2m1m2 n23 M1(G1 ) n1 M1(G2 )

ZAGREB TYPE INDICES FOR TENSOR PRODUCT OF GRAPHS
THEOREM 13

G1 and G2 are two simple graphs and if G1 G2 is connected then first Zagreb
index of G1 G2 is M1 (G1 G2 ) M1 (G1 ) M1 (G2 ) .
If

PROOF:
The first Zagreb index of
n1

M1 (G1 G2 )
n1

G1 G2 is

n2

dG1 G2 (ui , v j )

i 1 j 1

n2

dG1 (ui )dG2 (v j )

i 1 j 1
n1

(dG1 (ui ))2 (dG1 (v1 ))2 ....... ((dG2 (v j ))2

i 1
n1

(dG1 (ui ))2 M1 (G2 )

i 1

M1 (G1 G2 ) M1(G1 ) M1(G2 )

THEOREM 14

G1 and G2 are two simple graphs and if G1 G2 is connected then second Zagreb
index of G1 G2 is M 2 (G1 G2 ) 2M 2 (G1 ) M 2 (G2 ) .
If

http://www.iaeme.com/IJARET/index.asp

36

editor@iaeme.com

Zagreb Indices and Zagreb Coindices of Some Graph Operations

PROOF
The second Zagreb index of

M 2 (G1 G2 )

( u1 ,v1 )( u2 ,v2 )E ( G1 G2 )

( u1 ,v1 )( u2 ,v2 )E ( G1 G2 )

( u1 ,u2 )E ( G1 )

G1 G2 is
d(G1 G2 ) (u1, v1 )d(G1 G2 ) (u2 , v2 )

dG1 (u1 )dG2 (v1 )dG1 (u2 )dG2 (v2 )

dG1 (u1 )dG1 (u2 )

( u1 ,u2 )E ( G1 )

dG2 (v1 )dG2 (v2 )

M 2 (G1 G2 ) 2M 2 (G1 )M 2 (G2 )

THEOREM 15

G1 and G2 are two simple graphs and if G1 G2 is connected then first Zagreb
coindex of G1 G2 is M 1 (G1 G2 ) 4m1m2 (n1 n2 2) 2m2 (n2 1) M1(G1 )
If

2m1(n1 1)M1(G2 ) M1(G1 )M1(G2 )

PROOF: By Lemma (6 d) and Theorem 13,
We know that

M1(G) 2m(n 1) M1(G)

M1 (G) 2 E (G) ( V (G) 1) M1 (G)

M1(G1 G2 ) 2 E(G1 G2 ) V (G1 G2 ) 1 M1(G1 G2 )
2 2 E(G1 ) E(G2 ) V (G1 ) V (G1 ) 1 M1(G1)M1(G2 )

4m1m2 n1n2 1 M1 (G1 )M1 (G2 )

2m (n 1) M1 (G1 ) 2m2 (n2 1) M1 (G2 )
4m1m2 n1n2 1 1 1

4m1m2 (n1n2 1) 4m1m2 (n1 1)(n2 1)

2m1 (n1 1) M1 (G2 ) 2m2 (n2 1) M1 (G1 ) M1 (G1 )M1 (G2 )
4m1m2 (n1n2 1 n1n2 n1 n2 1)
2m1 (n1 1) M1 (G2 ) 2m2 (n2 1) M1 (G1 ) M1 (G1 )M1 (G2 )

M 1(G1 G2 ) 4m1m2 (n1 n2 2) 2m2 (n2 1)M1(G1 )

2m1(n1 1)M1(G2 ) M1(G1 )M1(G2 )

http://www.iaeme.com/IJARET/index.asp

37

editor@iaeme.com

K. Kiruthika

THEOREM 16

G1 and G2 be two simple graphs then, G1 G2 is connected such that second

Zagrebcoindex of G1 G2 is
Let

M 2 (G1 G2 ) 2m2 M 2 (G1 )(2m2 n2 1) 2m1 M 2 (G2 )(2m1 n1 1)

2m2 M1(G1 )(n2 m2 1) 2m1 M1(G2 )(n1 m1 1) 2M 2 (G1 )M 2 (G2 )
4m1m2 (m1 (n2 1) m2 (n1 1) (n1 1)(n2 1)) M1(G2 ) M 2 (G1 )
M1 (G1 ) M 2 (G2 ) M1 (G1 ) M1(G2 )
PROOF: By Lemma (6 d), Theorem 13 and Theorem 14,
1
M 2 (G) 2m2 M 2 (G) M1 (G)
2
We know that
.
1
2
M 2 (G) 2 E(G) M 2 (G) M1(G)
2
.
1
2
M 2 (G1 G2 ) 2 E(G1 G2 ) M 2 (G1 G2 ) M1 (G1 G2 )
2
2
1
2 2 E(G1 ) E(G2 ) 2M 2 (G1 ) M 2 (G2 ) M1(G1 ) M1(G2 )
2

1
2(2m1m2 )2 2M 2 (G1 ) M 2 (G2 ) M1 (G1 ) M1 (G2 )
2

8m12m22 2 2m12 M 2 (G1 ) M1 (G1 )

2

1
2

2
m

M
(
G
)

M1 (G2 )
2
2
2

1
2m1 (n1 1) M1 (G1 ) 2m2 (n2 1) M1 (G2 )
2

8m12m22 2 2m12 M 2 (G1 ) 2m1(n1 1) M1(G1 )

2

1
2

2m2 M 2 (G2 ) 2 2m2 (n2 1) M1(G2 )

1
2m1 (n1 1) M1 (G1 ) 2m2 (n2 1) M1 (G2 )
2
By above calculations, we conclude that

M 2 (G1 G2 ) 2m2 M 2 (G1 )(2m2 n2 1) 2m1 M 2 (G2 )(2m1 n1 1)

2m2 M1(G1 )(n2 m2 1) 2m1 M1(G2 )(n1 m1 1) 2M 2 (G1 )M 2 (G2 )

http://www.iaeme.com/IJARET/index.asp

38

editor@iaeme.com

Zagreb Indices and Zagreb Coindices of Some Graph Operations

4m1m2 (m1 (n2 1) m2 (n1 1) (n1 1)(n2 1)) M1(G2 ) M 2 (G1 )

M1 (G1 ) M 2 (G2 ) M1 (G1 ) M1(G2 )
ZAGREB TYPE INDICES FOR NORMAL PRODUCT OF GRAPHS
THEOREM 17
The First Zagreb index of normal product of two graphs

G1 and G2 is

M1 (G1 G2 ) (4m1 n1 )M1(G2 ) (4m2 n2 )M1(G1 ) 8m1m2 M1(G1 )M1(G2 )

PROOF
n1

n2

M1 (G1 G2 ) dG1 (ui ) dG2 (v j ) dG1 (ui )dG2 (v j )

i 1 j 1
n1

n2

dG1 (ui ) dG2 (v j ) dG1 (ui )dG2 (v j )

i 1 j 1

2 dG1 (ui ) dG2 (v j ) dG1 (ui )dG2 (v j )

n1

n2

dG1 (ui )2 dG2 (v j )2 2dG1 (ui )dG2 (v j )

i 1 j 1

dG1 (ui )2 dG2 (v j )2 2dG1 (ui )2 dG2 (v j ) 2 dG1 (ui )dG2 (v j )2

n1

n2

n1

n2

n1

n2

i 1

j 1

dG1 (ui )2 dG2 (v j )2 2 dG1 (ui ) dG2 (v j )

i 1 j 1

i 1 j 1

n1

n2

n1

n2

n1

n2

i 1

j 1

i 1

j 1

i 1

j 1

dG1 (ui )2 dG2 (v j )2 2 dG1 (ui )2 dG2 (v j ) 2 dG1 (ui ) dG2 (v j )2

n2 M1 (G1 ) n1M1 (G2 ) 2(2m1 )(2m2 ) M1(G1 ) M1(G2 )

2M1 (G1 )(2m2 ) 2(2m1 )M1(G2 )
n2 M1 (G1 ) n1M1 (G2 ) 8m1m2 M1 (G1 ) M1(G2 ) 4m2 M1 (G1 ) 4m1M1(G2 )
M1 (G1 G2 ) (4m1 n1 )M1(G2 ) (4m2 n2 )M1(G1 ) 8m1m2 M1(G1 )M1(G2 )
THEOREM 18
The First Zagreb coindex of normal product of two graphs

G1 and G2 is

M1(G1 G2 ) 2n1n2m1(n2 1) 2n1n2m2 (n1 1) 4m1m2 (n1 n2 ) (4m2 n2 )M1(G1 )

M1(G1 )M1(G2 ) M1(G1 )(n2 2m2n2 2m2 ) M1(G2 )(n1 2m1n1 2m1)

http://www.iaeme.com/IJARET/index.asp

39

editor@iaeme.com

K. Kiruthika

PROOF: By Lemma (6 e) and Theorem 17,

Using the property

M1(G) 2m(n 1) M1(G)

M1 (G) 2 E (G) ( V (G) 1) M1 (G)

M1(G1 G2 ) 2 E(G1 G2 ) V (G1 G2 ) 1 M1(G1 G2 )

2 2m1m2 n1m2 n2m1 (n1n2 1) M1(G1 G2 )

M1(G1 G2 ) 4m1m2n1n2 4m1m2 2n12n2m2 2n1m2 2n1n22m1 2n2m1

(4m1 n1 ) M1(G2 ) (4m2 n2 ) M1(G1 ) 8m1m2 M1 (G1 ) M1 (G2 )

4m1m2n1n2 4m1m2 2n12n2m2 2n1m2 2n1n22m1 2n2m1
(4m1 n1 ) 2m2 (n2 1) M1 (G2 ) (4m2 n2 ) 2m1 (n1 1) M1 (G1 )

8m1m2 2m1 (n1 1) M1 (G1 ) 2m2 (n2 1) M1(G2 )

4m1m2n1n2 4m1m2 2n12n2m2 2n1m2 2n1n22m1 2n2m1 8m1m2 (n2 1)
4m1 M1(G2 ) 2n1m2 (n2 1) n1 M1(G2 ) 8m1m2 (n1 1) 4m2 M1(G1 )

2n2m1 (n1 1) n2 M1(G1 ) 8m1m2 4m1m2 (n1 1)(n2 1)

2m2 (n2 1)M1(G1 ) M1(G1 )M1(G2 )
M1(G1 G2 ) 2n1n2m1(n2 1) 2n1n2m2 (n1 1) 4m1m2 (n1 n2 ) (4m2 n2 )M1(G1 )
M1(G1 )M1(G2 ) M1(G1 )(n2 2m2n2 2m2 ) M1(G2 )(n1 2m1n1 2m1)

CONCLUSION
In this paper, we have studied the Zagreb indices and Zagreb coindices andalso we
have investigated their basic mathematical properties and obtained explicit formulae
for computing their values under several graph operations namely Cartesian product,
Disjunction, Composition, Tensor product and Normal product of graphs.
Nevertheless, there are still many other graph operations and special classes of graphs
that are not covered here and we mention some possible directions for future research.

http://www.iaeme.com/IJARET/index.asp

40

editor@iaeme.com

Zagreb Indices and Zagreb Coindices of Some Graph Operations

REFERENCES
[1]
[2]

[3]
[4]
[5]

[6]
[7]

Ashrafi A R, T Doslic, A Hamzeb, The Zagreb coindices of Graph

operations, Discrete Applied Mathematics 158 (2010) 1571-1578.
BaskarBabujee J, Ramakrishnan S, Zagreb indices and coindices for
compound graphs, proceedings of ICMCM 2012, PSG Tech 19-21 Dec 2011,
Narosa publications, pp: 357362.
W. Imrich, S. Klavzar, Product Graphs: Strudture and Recognition, John
Wiley & Sons, New York, USA 2000.
Das K Ch, I Gutman, Some properties of the second Zagreb Index, MATCH
Commun. Math. Comput. Chem 52 (2004) 103-112.
Khalifeh M H, H Yousefi-Azari, A R Ashrafi, The First and Second Zagreb
indices of some graph operations, Discrete Applied Mathematics 157 (2009)
804811
Nenad Trinajstic, Chemical Graph Theory, Volume II, CRC Press, Inc., Boca
Raton, Florida, 1983.
Parthasarathy K R, Basic Graph Theory, Tata McGraw Hill Publishing
Company Limited, New Delhi, 1994.

http://www.iaeme.com/IJARET/index.asp

41

editor@iaeme.com