Some Bounds on Estrada Index of Graphs

IF 1.4 4区综合性期刊 Q2 MULTIDISCIPLINARY SCIENCES

Iranian Journal of Science and Technology, Transactions A: Science Pub Date : 2024-12-04 DOI:10.1007/s40995-024-01751-4

Mohammad Reza Oboudi

引用次数: 0

Abstract

Let G be a simple graph on n vertices. The Estrada index of G, denoted by EE(G), is defined as \(EE(G)=\sum _{i=1}^ne^{\lambda _i}\), where \(\lambda _1,\ldots ,\lambda _n\) are the eigenvalues (the eigenvalues of the adjacency matrix) of G. In this paper we find some sharp bounds on the Estrada index of graphs in terms of the number of vertices, the number of edges and the rank of graphs.

查看原文本刊更多论文

图的Estrada指数的若干界

设G是一个有n个顶点的简单图。G的Estrada指数，用EE(G)表示，定义为\(EE(G)=\sum _{i=1}^ne^{\lambda _i}\)，其中\(\lambda _1,\ldots ,\lambda _n\)是G的特征值（邻接矩阵的特征值）。本文从图的顶点数、边数和图的秩等方面，找到了图的Estrada指数的尖锐界限。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Iranian Journal of Science and Technology, Transactions A: Science MULTIDISCIPLINARY SCIENCES-

CiteScore

4.00

自引率

5.90%

发文量

122

审稿时长

>12 weeks

期刊介绍： The aim of this journal is to foster the growth of scientific research among Iranian scientists and to provide a medium which brings the fruits of their research to the attention of the world’s scientific community. The journal publishes original research findings – which may be theoretical, experimental or both - reviews, techniques, and comments spanning all subjects in the field of basic sciences, including Physics, Chemistry, Mathematics, Statistics, Biology and Earth Sciences