<?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-2383</article-id>
      <title-group>
        <article-title>M-polynomial of prime graph of commutative ring Zp2, Z2p and Zpq</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Khalel</surname>
            <given-names>Nermen J.</given-names>
          </name>
          <aff>Department of Mathematics, College of Computer Science and Mathematics, Tikrit University, Tikrit, Iraq</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>5</issue>
      <fpage>2013</fpage>
      <lpage>2018</lpage>
      <pub-date date-type="pub">
        <day>22</day>
        <month>05</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>This study examines the Mpolynomial defined by M(G; α, β) = ∑i ≤ j mij (G)αi βj of the prime graph associated with certain Commutative rings. The M-polynomial is a tool in graph theory that encodes details about the degrees of edges in a graph. The study defines the primegraph structure of a Commutative ring Zp2, Z2p and Zpq and calculates its M polynomial for several specific rings. The results include detailed theorems and proofs demonstrating how the M polynomial can be derived according to the degree sequences of the vertices in the prime graph. Examples are provided for different rings to illustrate the computation method. The work contributes to the ongoing research connecting algebraic structures, particularly Commutative rings, with graph-theoretic concepts.</p>
      </abstract>
      <kwd-group>
        <kwd>Prime graph</kwd>
        <kwd>M polynomial</kwd>
        <kwd>Commutative ring</kwd>
        <kwd>Graph theory</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>
