Non Deterministic Zero Divisor Graph
DOI:
https://doi.org/10.23755/rm.v48i0.1155Keywords:
Zero divisor graphs, Non deterministic graph, Weiner index, Weighted graph, Golden ratio rulAbstract
A non-deterministic zero divisor graph refers to an element in a ring or algebraic structure that can multiply with another element to give zero, but the specific outcome of the multiplication is not uniquely determined. In other words, there may be multiple elements that can multiply with the given element to produce zero. This concept is typically encountered in non-commutative rings or algebras where the order of multiplication matters. In such structures, the existence of non-deterministic zero divisors can complicate calculations and lead to different results depending on the order of operations. In this paper, we examine that all the zerodivisor graphs are nondeterministic graph but the converse need not. We manifest the nondeterministic zero divisor graph is possible only with nonprimes. Hereby, we study about weighted graphs, Weiner index and golden ratio rule. Also we provide an algorithm for zero divisor graph of n parameters and thereby, explore the given graph is either deterministic or nondeterministic graph using python.
References
Anderson, D. F., & Livingston, P. S. (2002). "The Zero-divisor graph of a commutative ring." International Journal of Commutative Ring, 2, 203-211.
Beck, I. (1988). "Coloring of Commutative Rings." Journal of Algebra, 1, 56-57.
Costa, D. A., & Faridi, S. (2005). "Zero-Divisor Graphs of Noncommutative Rings." Communications in Algebra, 1, 18-20.
Fan, W., & Liu, C. (2018). "Zero-Divisor Graphs from a Commutative Perspective." Frontiers of Mathematics in China, 13(1), 1-30.
Floyd, R. W. (1967). "Nondeterministic algorithms." Journal of the Association for Computing Machinery, 14, 636-644.
Gary Meisters, W. (1992). "A geometric analysis of the golden ratio." The College Mathematics Journal, 23, 2-19.
Harold Wiener (1972). "The Wiener index of a graph." Journal of Mathematical Chemistry, 7, 73-81.
Hassler Whitney (1932). "On the theory of graphs and its applications to the determination of molecular structure." Bulletin of the American Mathematical Society, 38, 575-580.
Kurtz, A. (1973). "Deterministic and Nondeterministic Graphs." Journal of Information and Control, 22, 205-226.
Rabin, M. O., & Scott (1956). "Finite Automata and Their Decision Problems." Journal of the Association for Computing Machinery, 3, 114-135.
Redmond, S. P. (2002). "The zero-divisor graph of a noncommutative ring." International Journal of Commutative Ring, 1, 203-211.
Downloads
Published
Issue
Section
License
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:
- Free access for all users worldwide
- Increased visibility and readership
- Rapid publication
- No spatial constraints
- Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)
Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified.
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.