
<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:format>application/pdf</dc:format>
  <dc:format>338534 bytes</dc:format>
  <dc:description xml:lang="eng">Abstract: 
It is shown that for every bipartite graph G not containing cycles of size divisible by 4, the graph energy E(G) and the Sombor energy ESO(G) are related as √2 δ E(G) ≤ ESO(G) ≤ √2 Δ E(G), where δ and Δ are the minimum and maximum vertex degrees in G.</dc:description>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:creator id="https://orcid.org/0000-0001-9681-1550">Gutman, Ivan</dc:creator>
  <dc:creator id="https://orcid.org/0000-0003-4956-0407">Redžepović, Izudin</dc:creator>
  <dc:creator>Rada, Juan</dc:creator>
  <dc:rights>http://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:subject xml:lang="eng">Keywords: Sombor index, Sombor energy, energy (of graph), degree (of vertex).</dc:subject>
  <dc:title xml:lang="eng">Relating energy and Sombor energy</dc:title>
  <dc:source>Contributions to Mathematics 4</dc:source>
  <dc:identifier>https://phaidrabg.bg.ac.rs/o:28959</dc:identifier>
  <dc:identifier>doi:10.47443/cm.2021.0054</dc:identifier>
  <dc:identifier>ISSN: 2709-3646</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:date>2021</dc:date>
</oai_dc:dc>