4.7 Article

On the eigenvalue and energy of extended adjacency matrix

Journal

APPLIED MATHEMATICS AND COMPUTATION
Volume 397, Issue -, Pages -

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2020.125939

Keywords

Extended adjacency matrix; Graph eigenvalue; Graph energy

Ask authors/readers for more resources

This paper investigates the extended adjacency matrix of a graph, explores its spectral properties and provides lower and upper bounds on the extended adjacency spectral radii. Additionally, the behavior of the extended adjacency energy of the graph is studied.
The extended adjacency matrix of graph G, A(ex) is a symmetric real matrix that if i not equal j and u(i)u(j) is an element of E(G), then the ijth entry is d(ui)(2) + d(uj)(2)/2d(ui)d(uj), and zero otherwise, where d(u), 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 A(ex) 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. (C) 2020 Published by Elsevier Inc.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available