
<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:date>2022</dc:date>
  <dc:language>eng</dc:language>
  <dc:identifier>https://phaidrabg.bg.ac.rs/o:28961</dc:identifier>
  <dc:identifier>doi:10.47443/dml.2021.s211</dc:identifier>
  <dc:identifier>ISSN: 2664-2557</dc:identifier>
  <dc:source>Discrete Mathematics Letters 9</dc:source>
  <dc:title xml:lang="eng">Sombor energy and Huckel rule</dc:title>
  <dc:rights>http://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:subject xml:lang="eng">Keywords: energy (of a graph), Sombor index, Sombor energy, graph energy, topological index, degree (of a vertex)</dc:subject>
  <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:description xml:lang="eng">Abstract: 
The Sombor index, a recently invented vertex-degree-based graph invariant, is insensitive to the size of cycles contained in a graph. In contrast to this, the Sombor energy, the sum of absolute values of the Sombor matrix, is found to have a significant cycle-size dependence. In the case of bipartite graphs, this dependence is analogous to the Huckel (4n + 2)-rule: cycles of size 4, 8, 12, . . . decrease, and cycles of size 6, 10, 12, . . . increase the Sombor energy. A theorem corroborating this empirical observation is offered.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:format>476807 bytes</dc:format>
</oai_dc:dc>
