2022
DOI: 10.5614/ejgta.2022.10.1.12
|View full text |Cite
|
Sign up to set email alerts
|

The matrix Jacobson graph of finite commutative rings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…One uses graphs to represent groups, for example, coprime [1,2], non-coprime [3,4], relative coprime [5], power [6], commuting [7], cyclic [8], and intersection [9] graphs. Rings are represented by the zero divisor [10], prime [11], and Jacobson [12,13] graphs. Vertices and edges in each type of graph are determined based on the definitions of the respective graphs [14][15][16].…”
Section: Introductionmentioning
confidence: 99%
“…One uses graphs to represent groups, for example, coprime [1,2], non-coprime [3,4], relative coprime [5], power [6], commuting [7], cyclic [8], and intersection [9] graphs. Rings are represented by the zero divisor [10], prime [11], and Jacobson [12,13] graphs. Vertices and edges in each type of graph are determined based on the definitions of the respective graphs [14][15][16].…”
Section: Introductionmentioning
confidence: 99%
“…Some graphs that can be used to represent a group are coprime graph [2], non-coprime graph [3], power graph [4], and intersection graph [5]. Graphs that can be used to represent a ring are zero divisor graph [6], prime graph [7], and Jacobson graph [8]. In addition, graphs that can be used to represent a module are annihilator graphs [9].…”
Section: Introductionmentioning
confidence: 99%