Status Sum Adjacency Energy of Graphs

Vol-4 | Issue-8 | August 2019 | Published Online: 16 August 2019    PDF ( 198 KB )
Author(s)
Saroja Talwar 1; Harishchandra Ramane 2

1Research Scholar, Department of Mathematics, Karnatak University, Pavate Nagar, Dharwad – 580003 (India)

2Professor, Department of Mathematics, Karnatak University, Pavate Nagar, Dharwad – 580003 (India)
Abstract

The status (u) of a point u in a connected graph G is the sum of the distances
between u and all other vertices in G. The status sum adjacency matrix of a
graph G is defined as SA(G) = [sij], where sij = (vi) + (vj), if vi is adjacent to vj
and sij = 0, otherwise. The status sum adjacency energy is defined as the sum of the absolute values of the eigenvalues of SA(G). In this paper we obtain bounds for the status sum adjacency energy of a graph.
Keywords
Status of a vertex, status sum adjacency matrix, eigenvalues, energy of a graph.
Statistics
Article View: 675