The increase in the resolvent energy of a graph due to the addition of a new edge

Alexander Farrugia

Applied Mathematics and Computation, 2018, vol. 321, issue C, 25-36

Abstract: The resolvent energy ER(G) of a graph G on n vertices whose adjacency matrix has eigenvalues λ1,…,λn is the sum of the reciprocals of the numbers n−λ1,…,n−λn. We introduce the resolvent energy matrix R(G) and present an algorithm that produces this matrix. This algorithm may also be used to update R(G) when new edges are introduced to G. Using the resolvent energy matrix R(G), we determine the increase in the resolvent energy ER(G) of G caused by such edge additions made to G. Moreover, we express this increase in terms of the characteristic polynomial of G and the characteristic polynomials of three vertex-deleted subgraphs of G.

Keywords: Resolvent energy; Resolvent energy matrix; Characteristic polynomial (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317307191
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:321:y:2018:i:c:p:25-36

DOI: 10.1016/j.amc.2017.10.020

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().