<?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.47974/JDMSC-2712</article-id>
      <title-group>
        <article-title>On the diameter of INZD-graph</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Kadem</surname>
            <given-names>Sameer</given-names>
          </name>
          <aff>Department of Mathematics, College of Science, University of Baghdad, Baghdad, Iraq</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Aubad</surname>
            <given-names>Ali A.</given-names>
          </name>
          <aff>Department of Mathematics, College of Science, University of Baghdad, Baghdad, Iraq</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>5</issue>
      <fpage>2109</fpage>
      <lpage>2116</lpage>
      <pub-date date-type="pub">
        <day>22</day>
        <month>05</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>Let R be a ring and let J be a proper ideal of R. In this work, we focus on the ideal-based non-zero divisor graph ∅J (R), whose vertices consist of the elements lying outside J, while adjacency is determined relative to this fixed ideal. main interest here is to understand how distances behave in this setting, especially when the graph is assumed to be connected. show that once ∅J(R) is connected and contains at least five vertices, the distance between any two vertices does not exceed two, apart from a few exceptional situations that are treated separately. In this way, the classical diameter bounds known for zero-divisor and non-zero divisor graphs naturally extend to the ideal-based context, while at the same time revealing how the presence of an ideal can subtly reshape the overall structure of the graph.</p>
      </abstract>
      <kwd-group>
        <kwd>ZD-graph</kwd>
        <kwd>Diameter</kwd>
        <kwd>Trees</kwd>
        <kwd>Connectivity</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>
