Conjectures on resolvent energy of graphs

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

Let λ 1 ≥ λ 2 ≥ ··· ≥ λ n be the eigenvalues of the adjacency matrix of a simple graph G of order n. A graph-spectrum-based invariant, put forward by Gutman et al. [Resolvent energy of graphs, MATCH Commun. Math. Comput. Chem. 75 (2016) 279–290], is defined as [Formula presented]. In the same paper the authors proposed several conjectures. In this paper we partially prove two conjectures.

Original languageEnglish
Pages (from-to)453-464
Number of pages12
JournalMatch
Volume81
Issue number2
StatePublished - 2019

Fingerprint

Dive into the research topics of 'Conjectures on resolvent energy of graphs'. Together they form a unique fingerprint.

Cite this