Resolvent energy of graphs

Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/17399

Full metadata record

DC Field	Value	Language
dc.contributor.author	Gutman, Ivan	-
dc.contributor.author	Furtula, Boris	-
dc.contributor.author	Zogic, Emir	-
dc.contributor.author	Glogić, Edin	-
dc.date.accessioned	2023-03-21T11:40:56Z	-
dc.date.available	2023-03-21T11:40:56Z	-
dc.date.issued	2016	-
dc.identifier.issn	0340-6253	en_US
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/17399	-
dc.description.abstract	The resolvent energy of a graph \(G\) of order \(n\) is defined as \(ER = \sum_{i=1}^n (n - \lambda_i)^{-1}\), where \(\lambda_1, \lambda_2, \ldots\lambda_n\) are the eigenvalues of \(G\). We establish a number of properties of \(ER\). In particular, we establish lower and upper bounds for \(ER\) and characterize the trees, unicyclic, and bicyclic graphs with smallest and greatest \(ER\).	en_US
dc.language.iso	en_US	en_US
dc.rights	info:eu-repo/semantics/openAccess	-
dc.source	MATCH Communications in Mathematical and in Computer Chemistry	-
dc.subject	eigenvalues of a graph	en_US
dc.subject	Graph spectra	en_US
dc.subject	resolvent matrix	en_US
dc.subject	resolvent energy of a graph	en_US
dc.title	Resolvent energy of graphs	en_US
dc.type	article	en_US
dc.description.version	Published	en_US
dc.type.version	PublishedVersion	en_US
Appears in Collections:	Faculty of Science, Kragujevac

372

82

Files in This Item:

File	Description	Size	Format
paper0112.pdf		280.63 kB	Adobe PDF	View/Open

SCIDAR - A Digital Archive of the University of Kragujevac