2017
DOI: 10.5937/spsunp1702187z
|View full text |Cite
|
Sign up to set email alerts
|

New bounds for the resolvent energy of graphs

Abstract: The resolvent energy of a graph G of order n is defined as ER(G) = ∑ n i=1 (n − λ i) −1 , where λ 1 ≥ λ 2 ≥ • • • ≥ λ n are the eigenvalues of G. Lower and upper bounds for the resolvent energy of a graph, which depend on some of the parameters n, λ 1 , λ n , det(R A (n)) = n ∏ i=1 1 n−λ i , are obtained.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 6 publications
(3 reference statements)
0
2
0
Order By: Relevance
“…17 Several papers have appeared dealing with the mathematical properties of this quantity. [21][22][23][24][25][26][27][28][29] Due to similar definitions of the resolvent energy (3) and the graph energy (1), the question about their relation naturally occurs. Fig.…”
Section: Graph Energy Versus Resolvent Energymentioning
confidence: 99%
“…17 Several papers have appeared dealing with the mathematical properties of this quantity. [21][22][23][24][25][26][27][28][29] Due to similar definitions of the resolvent energy (3) and the graph energy (1), the question about their relation naturally occurs. Fig.…”
Section: Graph Energy Versus Resolvent Energymentioning
confidence: 99%
“…For example, see the recent papers [13, 14] for the chemical applications of the first and second Zagreb indices. Detail about the mathematical properties of these Zagreb indices can be found in the recent surveys [15, 16], recent papers [17–27] and related references mentioned therein.…”
Section: Introductionmentioning
confidence: 99%