.png){kind=icon}
.png){kind=icon}
Return
Graphs derived from multirings
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-021-06361-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The purpose of this paper was to introduce the concepts of very thin multigroup, nondistributive (very thin) multirings, zero-divisor elements of multirings and zero-divisor graphs based on zero-divisor elements of multirings. In order to realize the article's goals, we consider the relationship between finite nondistributive (very thin) multirings and multirings and construct nondistributive (very thin) multirings based on given ring. By some conditions on prime numbers, finite (nondistributive) very thin multirings are constructed. Zero-divisor graph based on zero-divisor set of (nondistributive) (very thin) multirings are introduced, so we investigate of some necessity and sufficiency conditions such that compute of order and size of these zero-divisor graphs. Also, the notations of derivable zero-divisor graphs and derivable zero-divisor subgraphs are introduced and is showed that some multipartite graphs are derivable zero-divisor graphs, all complete graphs, and cyclic graphs are derivable zero-divisor subgraphs.
Keywords:
(Nondistributive) Multiring
Zero-divisor (sub)graph
Very thin (multigroup)
Very thin (multiring)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W