期刊
APPLIED MATHEMATICS AND COMPUTATION
卷 397, 期 -, 页码 -出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2020.125939
关键词
Extended adjacency matrix; Graph eigenvalue; Graph energy
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据