%0 Journal Article
%T Algorithm for Visualization of Zero Divisor Graphs of the Ring ℤ<sub>n</sub>  Using MAPLE Coding
%A Nasir Ali
%J Open Journal of Discrete Mathematics
%P 1-8
%@ 2161-7643
%D 2024
%I Scientific Research Publishing
%R 10.4236/ojdm.2024.141001
%X This research investigates the comparative efficacy of generating zero
divisor <span>graphs (ZDGs) of the ring of
integers &#8484;<sub>n</sub> modulo <i>n</i></span></span></span><span><span><span style=\"font-family:;\" \"=\"\"> </span></span></span><span><span><span style=\"font-family:;\" \"=\"\">using MAPLE algo</span></span></span><span><span><span style=\"font-family:;\" \"=\"\">rithm. <span>Zero divisor graphs, pivotal in
the study of ring theory, depict rela</span>tionships between elements of a
ring that multiply to zero. The paper explores <span>the development and implementation of algorithms in MAPLE for con</span>structing
these ZDGs. The comparative study aims to discern the strengths, limitations,
and computational efficiency of different MAPLE algorithms for creating zero
divisor graphs offering insights for mathematicians, researchers, and <span>computational enthusiasts involved in ring theory
and mathematica</span>l computations.</span></span></span>
%K Zero Divisor Graph
%K Ring Theory
%K Maple Algorithm
%K &amp
%K #8484
%K &lt
%K sub&gt
%K n&lt
%K /sub&gt
%K &lt
%K i&gt
%K Modulo n&lt
%K /i&gt
%K Graph Theory
%K Mathematical Computing
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=132059