Professional Documents
Culture Documents
The Sum-Eccentricity Energy of A Graph
The Sum-Eccentricity Energy of A Graph
_____________________________________________*****___________________________________________
1. Introduction
In this paper, all graphs are assumed to be finite connected simple graphs.
A graph G (V , E ) is a simple graph, that is, having no loops, no multiple
and directed edges. As usual, we denote n to be the order and m to
be the size of the graph G . For a vertex v V , the open neighborhood
of v in a graph G , denoted N (v), is the set of all vertecies that are
adjacent to v and the closed neighborhood of v is N[v] N (v) {v}. The
degree of a vertex v in G is d (v) | N (v) | . The distance d (u, v) between
any two vertices u and v in a graph G is the length of the shortest
293
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
path connecting them. The eccevtricity of a vertex v G is
e(v) max{ d (u, v):u V (G)}. The radius of G is r (G) min{e(v):v V (G)} and the
diameter of G is D(G) max{ e(v):v V (G)}. Hence r (G) e(v)( D(G), for
every v V (G). A vertex v in a connected graph G is central if
e(v) r (G), while a vertex v in a connected graph G is peripheral vertex
if e(v) D(G). A graph G is called self centered graph if e(v) r (G) D(G).
The girth of a graph G is the length of the shortest cycle contained in
the graph and denoted by g (G). All the defnitions and terminologies
about the graph in this paragraph available in [9].
C. Adiga et. al. [2], have defined the maximum degree energy EM (G) of a
graph G which depends on the maximum degree matrix M (G) of G. Let
G be a simple graph with n vertices v1 , v2 ,, vn . Then the maximum
degree matrix M (G) (d ij ) of a graph G defined as
294
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
max{ d (vi ), d (v j )}, if vi v j E,
d ij
0 , otherwise.
As M (G) is real symmetric with zero trace, then the eigenvalues of G
being real with sm equal to zero.
Ahmed M. Naji et. al. [3], have defined the concept of maximum
eccentricity matrix M e (G) of a connected graph G. They obtained the
maximum eccentricity energy EM e (G) of a graph depends on the
maximum eccentricity matrix. Let G be a simple connected graph with n
vertices v1 , v2 ,, vn and let e(vi ) be the eccentricity of a vetex vi , i 1, 2,..., n
The maximum eccentricity matrix of G defined as M e (G) (eij ), where
max{ e(vi ), e(v j )}, if vi v j E,
eij
0 , otherwise.
Motivated by those papers, we introduce the concept of the sum -
eccentricity matrix S e (G) of a graph G and obtain some coefficients of
the characteristic polynomial P(G, ) of the sum-eccentricity matrix of G .
We also introduce the sum-eccentricity energy ES e (G) of a graph G.
Sum-eccentricity energies of some well -known graphs are obtained.
Upper and lower bounds for ES e (G) are estblished. It is shown that if
the sum-eccentricity energy of a graph is rational then it must be an
even.
295
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
G.
Since S e (G) is real symmetric with zero trace, its eigenvalues must be
realwith sum equal to zero, i.e., trace(Se (G)) 0. We lable the eigenvalues
1 , 2 ,, n in a non-increasing manner 1 2 n . The sum-eccentrcity
energy of a graph G is denoted by ES e (G) and is defined as the
summation of the absolute value of the eigenvalues
n
ES e (G) | i | .
i 1
296
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
The charracteristic polynomial of S e (G2 ) is
P(G2 , ) 5 403 162 240 128 ( 2) 4 ( 8).
The sum-eccentricity eigenvalues of G2 are
1 8, 2 2, 3 2, 4 2, 5 2.
The sum-eccentricity energy of G2 is
ES e (G2 ) 16.
3. BOUNDS FOR SUM-ECCENTRICITY ENERGY AND SUM-
ECCENTRICITY EIGENVALUES
We now give the explicit expression for the coefficient ci of
ni (i 0,1, 2, 3 and n) in the characteristic polynomial of the sum -eccentricity
matrix S e (G).
Proof. The proof of parts (1) and (2) are similar to the proof in [2].
3. Since
0 sij
c2 0 (s s ) s
2
ij ji ij
1i j n s ji 0 1i j n 1i j n
and since
e(vi ) e(v j ) , if vi v j E ,
sij
0 , otherwise.
n
Thus c2 (e(v ) e(v ))
i 1, i j
i j
2
, where vi v j E.
297
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
4. We have
sii n
sij sik
c2 s ji s jj s jk
1i j k n
ski skj skk
n
2 (s s
1i j k n
ij ik s jk )
n
2 [(e(v ) e(v ))(e(v ) e(v
vi v j vk ,1 i j k n
i j i k ))(e(v j )e(vk ))]
n
2 (2e(v )e(v )e(v
vi v j vk ,1 i j k n
i j k ) e(vi ) 2 e(v j ) e(vi ) 2 e(vk ) e(v j ) 2 e(vi )
k 1
[(3 3) 2 (3 2) 2 (3 2) 2 (3 2) 2 (2 2) 2 (2 2) 2 (2 3) 2 ] 168
b. If g (G) 3, then c3 0.
i 1
i
2
2c2 .
Proof. We have
n n n n n n
i 2 trace(Se2 (G))
i 1 i 1
sik ski 2
k 1 i 1
sik2 2
ik
s
i 1, i k
2
ik
298
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
n
2 (e(v ) e(v ))
i 1, i k
i k
2
, where vi vk E ,
hence
i 1
i
2
2c2 .
c2 2n(n 1).
n
Proof. We have c2 (e(v ) e(v ))
i 1, i j
i j
2
, where vi v j E,
n 1
n(n 1)
c2 (2 2) 2 i 4 2n(n 1).
i 1 2
i 1
i
2
4n(n 1).
(n 2)2j
c2 2n((n 1) 2 .
2
Proof. We have
trace(Se2 ( K n )) 4n(n 1)
299
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
by Cauchy-Schwartz inequality, we have
n n
i2 (n 1)
i 1, i j
i 1, i j
2
i (n 1)(4n(n 1) 2j )
so
i 1, i j
2
i 4n(n 1) 2 2j (n 1)
n
i.e. i2 4n(n 1) 2 2j (n 1) 2j 4n(n 1) 2 2j (n 2).
i 1
(n 2)2j
c2 2n((n 1) 2 .
2
2n 2 c2 4n 3 (n 1) 2
n 2
2 (e(vi ) e(v j )) 2 n(n 1) Ln ES e (G)
i 1, i j n2
,
n
where vi v j E , L i and n 2 for the left side of the inequality.
i 1
Proof. We have
n
E 2 S e (G) ( | i |) 2
i 1
n
| i |2 | i || j |.
i 1 i j
Using the last inequality in theorem 3.1 and Arithmatic mean, Geometric
mean inequality we get
n
E S e (G) 2
2
(e(v ) e(v )) |
i 1, i j
i j
2
i j
i || j |, where vi v j E,
but
300
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
|
i j
i || j | | 1 | (| 2 | | 3 | ... | n |)
| 2 | (| 1 | | 3 | ... | n |)
| n | (| 1 | | 2 | ... | n1 |)
1 1
hence
n 2
2 (e(vi ) e(v j )) 2 n(n 1) Ln ES e (G),
i 1, i j
n
where vi v j E and L i .
i 1
2c2 4n(n 1) 2
| j | ,
n2
so
n
2n 2 c2 4n 3 (n 1) 2
| j |
j 1 n2
, where n 2.
r 1 , r 2 ,, n arenon-positive. Then,
301
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
ES e (G) 2(1 2 r ).
n 3 , if n is even,
c2
n(n 1) 2 , if n is odd .
n
Proof. We have c2 (e(v ) e(v ))
i 1, i j
i j
2
,
and
n
2 , if n is even,
e(vi )
(n 1) , if n is odd ,
2
n
n
so if n is even c2 (2 2 )
i 1, i j
2
n 3 ,
n
n 1 2
and if n is odd c2 (2
i 1, i j 2
) n(n 1) 2 ,
thus
n 3 , if n is even,
c2
n(n 1) 2 , if n is odd .
302
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 293 304
_______________________________________________________________________________________________
Theorem 4.1. The sum-eccentricity eigenvalues for the complete graph
K n are 2 and 2(n 1) with multiplicities (n 1) and 1 respectively, and the sum-
eccentricity energy for K n is 4(n 1).
Proof. We have
2 2 2
2 2 2
| I S e ( K n ) | 2 2 2
2 2 2
2 2 2
1 1 0 0
( 2) n 1
1 0 1 0
1 0 0 1
( 2) n1 ( 2(n 1)).
References
304
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________