Granular computing in zero-divisor graphs of Zn
In this article, we study the zero-divisor graphs Γ(Zn) of rings of integers modulo n as information systems I(Γ(Zn)) using equivalence classes and rough sets. Equivalence classes are referred as granules and partitions are referred as indiscernible partitions. We define an indiscernibility relation...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-07-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S2307410824000567 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|