
<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:creator id="https://orcid.org/0000-0001-9866-1541">Allem, Luiz Emilio</dc:creator>
  <dc:creator id="https://orcid.org/0000-0002-8483-3100">Capaverde, Juliane</dc:creator>
  <dc:creator id="https://orcid.org/0000-0002-7053-8530">Trevisan, Vilmar</dc:creator>
  <dc:creator id="https://orcid.org/0000-0001-9681-1550">Gutman, Ivan</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 77(1)</dc:source>
  <dc:title xml:lang="eng">Resolvent Energy of Unicyclic, Bicyclic and Tricyclic Graphs</dc:title>
  <dc:identifier>https://phaidrabg.bg.ac.rs/o:28923</dc:identifier>
  <dc:identifier>ISSN: 0340-6253</dc:identifier>
  <dc:date>2017</dc:date>
  <dc:subject xml:lang="eng">Keywords: Graph spectrum, energy of graphs, resolvent energy</dc:subject>
  <dc:description xml:lang="eng">Abstract:
The resolvent energy of a graph G of order n is defined as ER(G) = ∑(n − λi)-1, where
λ1, λ2, . . . , λn are the eigenvalues of G. In a recent work [Gutman et al., MATCH Commun.
Math. Comput. Chem. 75 (2016) 279–290] the structure of the graphs extremal w.r.t.
ER were conjectured, based on an extensive computer–aided search. We now confirm the
validity of some of these conjectures.
</dc:description>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:format>application/pdf</dc:format>
  <dc:format>384625 bytes</dc:format>
  <dc:language>eng</dc:language>
  <dc:rights>All rights reserved</dc:rights>
</oai_dc:dc>
