✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
In this article, degree distance of zero-divisor graph Г[Z_n ] is computed for n=p^2,n=pq and n=p^3, where p,q are distinct prime numbers.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:In this article, degree distance of zero-divisor graph Г[Z_n ] is computed for n=p^2,n=pq and n=p^3, where p,q are distinct prime numbers.
📊
Temel Bulgular & Veri:In this article, degree distance of zero-divisor graph Г[Z_n ] is computed for n=p^2,n=pq and n=p^3, where p,q are distinct prime numbers.
💡
Sonuç & Katkı:In this article, degree distance of zero-divisor graph Г[Z_n ] is computed for n=p^2,n=pq and n=p^3, where p,q are distinct prime numbers.
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Zero-divisor graph · degree distance · topological index
Abstract
In this article, degree distance of zero-divisor graph Г[Z_n ] is computed for n=p^2,n=pq and n=p^3, where p,q are distinct prime numbers.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
Yalçın, N. (2020). Degree Distance of Zero-Divisor Graph Г[Z_n ]. Sakarya University Journal of Science, Volume: 24 Issue: 3. https://doi.org/10.16984/saufenbilder.549532