Generalized Eccentricity k^th Power Sum Adjacency Energy of Graphs (EGE^k SA(G))

Abstract

Let  be a finite, simple and undirected graph. For any integer , generalized eccentricity  power sum adjacency matrix of  is  matrix with its  entry as  and zero otherwise, where  is the eccentricity of  the vertex v of a graph G. In this paper, the new energy of graph          under the name as generalized eccentricity  power sum adjacency energy of   has been introduced. Generalized eccentricity  power sum adjacency energy   of some standard graphs and regular graphs obtained  by complete graph.

Let  be a finite, simple and undirected graph. For any integer , generalized eccentricity  power sum adjacency matrix of  is  matrix with its  entry as  and zero otherwise, where  is the eccentricity of  the vertex v of a graph G. In this paper, the new energy of graph          under the name as generalized eccentricity  power sum adjacency energy of   has been introduced. Generalized eccentricity  power sum adjacency energy   of some standard graphs and regular graphs obtained  by complete graph.