<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-information-and-optimization-sciences</journal-id>
      <journal-title-group>
        <journal-title>Journal of Information and Optimization Sciences</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0103</issn>
      <issn publication-format="print">0252-2667</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JIOS-1500</article-id>
      <title-group>
        <article-title>Sombor-index-like invariants of some graphs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Ghanbari</surname>
            <given-names>Nima</given-names>
          </name>
          <aff>Department of Informatics, University of Bergen, Bergen, P. O. Box 7803, 5020, Norway</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Alikhani</surname>
            <given-names>Saeid</given-names>
          </name>
          <aff>Department of Mathematical Sciences, Yazd University, Yazd, 89195-741, Iran</aff>
        </contrib>
      </contrib-group>
      <volume>47</volume>
      <issue>1</issue>
      <fpage>133</fpage>
      <lpage>143</lpage>
      <pub-date date-type="pub">
        <day>09</day>
        <month>09</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>The Sombor index (SO) is a vertex-degree-based graph invariant, defined as the sum over all pairs of adjacent vertices of √d2i +d2j, where di is the degree of the i-th vertex. It has been conceived using geometric considerations. Recently, a series of new SO-like degree-based graph invariants (denoted by SO1, SO2, ..., SO6) is taken into consideration, when the geometric background of several classical topological indices (Zagreb, Albertson) has considered. In this paper, we compute and study these new indices for some graphs, cactus chains and polymers. </p>
      </abstract>
      <kwd-group>
        <kwd>Sombor index</kwd>
        <kwd>Degree</kwd>
        <kwd>Vertex-degree-based graph invariant</kwd>
        <kwd>Polymer</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
