Abstract
The extended adjacency matrix of graph G,Aex is a symmetric real matrix that if i≠j and uiuj∈E(G), then the ijth entry is dui2+duj2/2duiduj, and zero otherwise, where du indicates the degree of vertex u. In the present paper, several investigations of the extended adjacency matrix are undertaken and then some spectral properties of Aex are given. Moreover, we present some lower and upper bounds on extended adjacency spectral radii of graphs. Besides, we also study the behavior of the extended adjacency energy of a graph G.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
