Bounds on α-distance Randić Estrada index
In this paper, for a simple undirected connected graph [Formula: see text] and [Formula: see text], the concept of [Formula: see text]-distance Randić Estrada index of [Formula: see text] is studied. The notion of [Formula: see text]-distance Randić energy of [Formula: see text] is also investigated. Sharp lower and upper bounds for the [Formula: see text]-distance Randić Estrada index are obtained, and the extremal graphs are characterized. Additionally, a relation between the [Formula: see text]-distance Randić Estrada index and the [Formula: see text]-distance Randić energy of graphs is achieved. Moreover, a bound for the subdominant eigenvalues (eigenvalues different from the Perron value) of the [Formula: see text]-distance Randić matrix is presented.
Authors
- Eber Lenes (ORCID: https://orcid.org/0000-0003-3880-1279)
- María Robbiano (ORCID: https://orcid.org/0000-0002-4533-6742)
- Enide Andrade
- Jonnathan Rodriguez
Publication Details
- Journal
- Discrete Mathematics Algorithms and Applications
- Published
- 2026-10-07
- DOI
- https://doi.org/10.1142/s1793830926501004
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00