On the extended Estrada index of some graphs.

Applied Mathematics and Computation(2019)

引用 2|浏览14
暂无评分
摘要
Let G be a graph on n vertices and η1,η2,…,ηn the eigenvalues of its extended adjacency matrix. The extended Estrada index EEex is defined as the sum of the terms eηi,i=1,2,…,n. In this paper we show the extended Estrada index of the complete bipartite graphs and the friendship graphs. Also the relationship of the extended Estrada index between the m-splitting, m-shadow graphs and the original graphs are obtained.
更多
查看译文
关键词
Extended adjacency matrix,Extended Estrada index,Bound
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要