201. On the eigenvalue and energy of extended adjacency matrix.
- Author
-
Ghorbani, Modjtaba, Li, Xueliang, Zangi, Samaneh, and Amraei, Najaf
- Subjects
- *
SYMMETRIC matrices , *MATRICES (Mathematics) , *MATHEMATICS , *EIGENVALUES - Abstract
• In the abstract, the correct definition of A ex (G) is added. • The definitions for the matrix A and for the matrix SDD are added. • The adjacency matrix A (G) was defined. • On page 2, after "For recent research along these lines, we added: see [5,20,33] and "Recall that the extended adjacency matrix is just one among a large number of degree-based graph matrices; for details see [A]." • On page 10, together with Refs. [17, 21, 19] we quoted also [B]:r • On page 10, together with Ref. [27] we quoted also Ref [A]. • Two following refs are added: [A] K. C. Das, I. Gutman, I. Milovanovi'c, E. Milovanovi'c, B. Furtula, Degree-based energies of graphs, Linear Algebra Appl. 554 (2018) 185–204. [B] I. Gutman, H. Ramane, Research on graph energies in 2019, MATCH Commun. Math. Comput. Chem. 84 (2020) 277–292. The extended adjacency matrix of graph G , A e x is a symmetric real matrix that if i ≠ j and u i u j ∈ E (G) , then the i j th entry is d u i 2 + d u j 2 / 2 d u i d u j , 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 e x 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. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF