
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
  <dc:rights>All rights reserved</dc:rights>
  <dc:subject xml:lang="eng">Keywords: Graph spectrum, energy of graphs, resolvent energy</dc:subject>
  <dc:date>2016</dc:date>
  <dc:description xml:lang="eng">Abstract:
The resolvent energy of a graph G of order n is defined as ER =∑(n − λi)-1, where λ1, λ2, . . . , λ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.
</dc:description>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:format>application/pdf</dc:format>
  <dc:format>287361 bytes</dc:format>
  <dc:language>eng</dc:language>
  <dc:creator id="https://orcid.org/0000-0001-9681-1550">Gutman, Ivan</dc:creator>
  <dc:creator id="https://orcid.org/0000-0002-5056-6892">Furtula, Boris</dc:creator>
  <dc:creator id="https://orcid.org/0000-0002-1355-3785">Zogić, Emir</dc:creator>
  <dc:creator id="https://orcid.org/0000-0001-6295-8298">Glogić, Edin</dc:creator>
  <dc:source>MATCH Communications in Mathematical and in Computer Chemistry 75(2)</dc:source>
  <dc:title xml:lang="eng">Resolvent Energy of Graphs</dc:title>
  <dc:identifier>https://phaidrabg.bg.ac.rs/o:28924</dc:identifier>
  <dc:identifier>ISSN: 0340-6253</dc:identifier>
</oai_dc:dc>