M-polynomial of prime graph of commutative ring Zp2 , Z2p and Zpq
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (5) · 2013-2018
DOI: 10.47974/jdmsc-2383 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von Nermen J. Khalel.
Abstract (Originalsprache)
This study examines the Mpolynomial defined by M(G; α, β) = Σi ≤ j mij (G)αi βjof 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.
Zitieren
APA
Khalel, N. J. (2026). M-polynomial of prime graph of commutative ring Zp2 , Z2p and Zpq. Journal of Discrete Mathematical Sciences & Cryptography, 29(5), 2013-2018. https://doi.org/10.47974/jdmsc-2383
Vancouver
Khalel NJ. M-polynomial of prime graph of commutative ring Zp2 , Z2p and Zpq. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(5):2013-2018. doi:10.47974/jdmsc-2383
BibTeX
@article{Khalel2026,
author = {Khalel, Nermen J.},
title = {M-polynomial of prime graph of commutative ring Zp2 , Z2p and Zpq},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {5},
pages = {2013--2018},
doi = {10.47974/jdmsc-2383}
}
EUVIMED