<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1080/09720529.2021.1936898</article-id>
      <title-group>
        <article-title>On the degree locating indices of graphs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Saleh</surname>
            <given-names>Anwar</given-names>
          </name>
          <aff>Department of Mathematics, Faculty of Science, Jeddah, University of Jeddah, Saudi Arabia</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Zeyada</surname>
            <given-names>Nasr A.</given-names>
          </name>
          <aff>Department of Mathematics, Faculty of Science, Jeddah, University of Jeddah, Saudi Arabia</aff>
        </contrib>
      </contrib-group>
      <volume>26</volume>
      <issue>1</issue>
      <fpage>255</fpage>
      <lpage>269</lpage>
      <pub-date date-type="pub">
        <day>15</day>
        <month>11</month>
        <year>2021</year>
      </pub-date>
      <abstract>
        <p>Graph theory has supported chemists with topological indices which predict different physicochemical properties such as boiling point, entropy, acentric factor, etc. of chemical compounds. In this article, we introduce two new topological indices called degree locating indices, based on the degree and location of the vertices. We present exact expressions for some families of standard graphs and we get the exact values of these indices for any graph of diameter two. Finally, we compute these indices for join graphs and book graphs.</p>
      </abstract>
      <kwd-group>
        <kwd>Zagreb indices</kwd>
        <kwd>First and second locating indices</kwd>
        <kwd>Join graph</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>
