✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
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 Key Takeaways
🎯
Objective & Hypothesis: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.
📊
Key Findings & Data: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.
💡
Conclusion & Impact: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.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables: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.
🔖
Cite This Article
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