EUVIMEDEUVIMED entdecken
Crossref

On the diameter of INZD-graph

Sameer Kadem, Ali A. Aubad

Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (5) · 2109-2116

DOI: 10.47974/jdmsc-2712 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von Sameer Kadem und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Kadem, S., & Aubad, A. A. (2026). On the diameter of INZD-graph. Journal of Discrete Mathematical Sciences & Cryptography, 29(5), 2109-2116. https://doi.org/10.47974/jdmsc-2712

Vancouver

Kadem S, Aubad AA. On the diameter of INZD-graph. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(5):2109-2116. doi:10.47974/jdmsc-2712

BibTeX
@article{Kadem2026,
  author = {Kadem, Sameer and Aubad, Ali A.},
  title = {On the diameter of INZD-graph},
  journal = {Journal of Discrete Mathematical Sciences & Cryptography},
  year = {2026},
  volume = {29},
  number = {5},
  pages = {2109--2116},
  doi = {10.47974/jdmsc-2712}
}
Kostenlos starten →