Abstract
The extended adjacency matrix Ae(G) of a graph G is determined by graph degrees. Some inequalities are found for the extended adjacency matrix including its vertices, its edges and its degrees in this paper. Also, some bounds are established for this matrix involving its energy and its Laplacian energy.
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
