On α-adjacency energy of graphs and Zagreb index

Let A(G) be the adjacency matrix and D(G) be the diagonal matrix of the vertex degrees of a simple connected graph G. Nikiforov defined the matrix of the convex combinations of D(G) and A(G) as for If are the eigenvalues of (which we call α-adjacency eigenvalues of G), the α-adjacency energy of G is...

Full description

Bibliographic Details
Main Authors: S. Pirzada, Bilal A. Rather, Hilal A. Ganie, Rezwan ul Shaban
Format: Article
Language:English
Published: Taylor & Francis Group 2021-01-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:http://dx.doi.org/10.1080/09728600.2021.1917973