TY - JOUR

T1 - Average degree matrix and average degree energy

AU - Sujatha, H. S.

N1 - Publisher Copyright:
© 2022 World Scientific Publishing Company.

PY - 2022

Y1 - 2022

N2 - If G is a simple graph on n vertices v1,v2,...,vn and di be the degree of ith vertex vi then the average degree matrix of graph G, AD(G) is of order n × n whose (i,j)th entry is di+dj 2 if the vertices vi and vj are adjacent and zero otherwise. The average degree energy of G, AD(E(G)) is the sum of all absolute value of eigenvalues of average degree matrix of a graph G. In this paper, bounds for average degree energy AD(E(G)) and the relation between average degree energy AD(E(G)) and energy E(G) is discussed.

AB - If G is a simple graph on n vertices v1,v2,...,vn and di be the degree of ith vertex vi then the average degree matrix of graph G, AD(G) is of order n × n whose (i,j)th entry is di+dj 2 if the vertices vi and vj are adjacent and zero otherwise. The average degree energy of G, AD(E(G)) is the sum of all absolute value of eigenvalues of average degree matrix of a graph G. In this paper, bounds for average degree energy AD(E(G)) and the relation between average degree energy AD(E(G)) and energy E(G) is discussed.

UR - http://www.scopus.com/inward/record.url?scp=85131039855&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85131039855&partnerID=8YFLogxK

U2 - 10.1142/S1793830922501014

DO - 10.1142/S1793830922501014

M3 - Article

AN - SCOPUS:85131039855

SN - 1793-8309

JO - Discrete Mathematics, Algorithms and Applications

JF - Discrete Mathematics, Algorithms and Applications

M1 - 2250101

ER -