Rezwan Ul Shaban, Muhammad Imran, Hilal A. Ganie

Research output: Contribution to journalArticlepeer-review


For the adjacency matrix A(G) and diagonal matrix of the vertex degrees D(G) of a simple graph G, the Aα(G) matrix is the convex combinations of D(G) and A(G), and is defined as Aα(G) = αD(G)+(1 − α)A(G), for 0 ≤ α ≤ 1. Let ρ1 ≥ ρ2 ≥ … ≥ ρn be the eigenvalues of Aα(G) (which we call α -adjacency eigenvalues of the graph G). The generalized adjacency energy also called α -adjacency energy of the graph G is defined as E (G) = (Formula presented.), where (Formula presented.) n is the average vertex degree, m is the size and n is the order of G. The α -adjacency energy of a graph G merges the theory of energy (adjacency energy) and the signless Laplacian energy, as EA0 (G) = E (G) and 2E A1/2(G) = QE(G), where E (G) is the energy and QE(G) is the signless Laplacian energy of G. In this paper, we obtain some new upper and lower bounds for the generalized adjacency energy of a graph, in terms of different graph parameters like the vertex covering number, the Zagreb index, the number of edges, the number of vertices, etc. We characterize the extremal graphs attained these bounds.

Original languageEnglish
Pages (from-to)127-141
Number of pages15
JournalJournal of Mathematical Inequalities
Issue number1
Publication statusPublished - 2024


  • Adjacency matrix
  • Laplacian (signless Laplacian) matrix
  • regular graph
  • α - adjacency matrix
  • α -adjacency energy

ASJC Scopus subject areas

  • Analysis


Dive into the research topics of 'BOUNDS FOR THE α –ADJACENCY ENERGY OF A GRAPH'. Together they form a unique fingerprint.

Cite this