2021Discrete Mathematics Algorithms and ApplicationsRequires access

On generalized adjacency Estrada index of graphs

Maryam Baghipur, Harishchandra S. Ramane

Open publisher page 0 citations

Abstract

The Estrada index is a graph-spectrum-based invariant having an important role in chemistry and physics. In this paper, we define the generalized adjacency Estrada index of a graph and obtain some lower and upper bounds for the generalized adjacency Estrada index in terms of various graph parameters associated with the structure of a graph. Further, we characterize the extremal graphs attaining these bounds. We also highlight the relationship between generalized adjacency Estrada index and generalized adjacency energy. Using these results, we obtain the improved bounds for the Estrada index based on the adjacency eigenvalues of a graph.

About this research paper

What this paper is about

The Estrada index is a graph-spectrum-based invariant having an important role in chemistry and physics. In this paper, we define the generalized adjacency Estrada index of a graph and obtain some lower and upper bounds for the generalized adjacency Estrada index in terms of various graph parameters associated with the structure of a graph. Further, we characterize the extremal graphs attaining these bounds. We also highlight the relationship between generalized adjacency Estrada index and generalized adjacency energy. Using these results, we obtain the improved bounds for the Estrada index based on the adjacency eigenvalues of a graph.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Estrada index is a graph-spectrum-based invariant having an important role in chemistry and physics. In this paper, we define the generalized adjacency Estrada index of a graph and obtain some lower and upper bounds for the generalized adjacency Estrada index in terms of various graph parameters associated with the structure of a graph. Further, we characterize the extremal graphs attaining these bounds. We also highlight the relationship between generalized adjacency Estrada index and generalized adjacency energy. Using these results, we obtain the improved bounds for the Estrada index based on the adjacency eigenvalues of a graph.

Key concepts: Adjacency list, Graph energy, Mathematics, Adjacency matrix, Combinatorics, Graph, Eigenvalues and eigenvectors, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
On generalized adjacency Estrada index of graphs — Research Paper | ScholarLens