<?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-2158</article-id>
      <title-group>
        <article-title>Leap neighbourhood Zagreb indices and coindices of graphs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Kumar</surname>
            <given-names>K. Hemanth</given-names>
          </name>
          <aff>Department of Mathematics, Yuvaraja’s College, University of Mysuru, Mysuru, 570006, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Ahmed</surname>
            <given-names>Hanan</given-names>
          </name>
          <aff>Department of Mathematics, Ibb University, Ibb, Yemen</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Salestina</surname>
            <given-names>M. Ruby</given-names>
          </name>
          <aff>Department of Mathematics, Yuvaraja’s College, University of Mysuru, Mysuru, 570006, India</aff>
        </contrib>
      </contrib-group>
      <volume>47</volume>
      <issue>6</issue>
      <fpage>2363</fpage>
      <lpage>2379</lpage>
      <pub-date date-type="pub">
        <day>13</day>
        <month>05</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>This study investigates and defines a novel vertex degree-based topological index, specifically the Leap Neighbourhood Zagreb indices and coindices of a graph R. These indices are distance-degree-based topological indices derived from the second degrees of vertices, which refer to the number of second neighbours associated with each vertex. The precise formulas for certain standard graphs are computed. The relationships between the Leap Neighbourhood Zagreb Indices, each of the Leap Zagreb indices, and the Zagreb indices are established. Finally, the lower and upper bounds are determined.</p>
      </abstract>
      <kwd-group>
        <kwd>Leap neighbourhood Zagreb indices</kwd>
        <kwd>Zagreb indices</kwd>
        <kwd>Vertex degree</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>
