2012
DOI: 10.1007/s10474-012-0250-3
|View full text |Cite
|
Sign up to set email alerts
|

The unit graph of a left Artinian ring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(12 citation statements)
references
References 8 publications
0
12
0
Order By: Relevance
“…McKenzie and Schneider. However, Anderson and Badawi [3] proved that for each integer n ≥ 1, there exists a ring R such that its total graph has diameter n. For the unit graph, Heydari and Nikmehr [12] proved that its diameter is 1, 2, 3 or ∞ for an Artinian ring.…”
Section: Huadong Su and Yangjiang Weimentioning
confidence: 99%
See 1 more Smart Citation
“…McKenzie and Schneider. However, Anderson and Badawi [3] proved that for each integer n ≥ 1, there exists a ring R such that its total graph has diameter n. For the unit graph, Heydari and Nikmehr [12] proved that its diameter is 1, 2, 3 or ∞ for an Artinian ring.…”
Section: Huadong Su and Yangjiang Weimentioning
confidence: 99%
“…Maimani et al gave the necessary and sufficient conditions for unit graphs to be Hamiltonian in [15]. Heydari and Nikmehr investigated the unit graph of a left Artinian ring in [12]. Afkhami and Khosh-Ahang studied the unit graphs of rings of polynomials and power series in [1].…”
Section: Huadong Su and Yangjiang Weimentioning
confidence: 99%
“…There are many papers on assigning a graph to rings, see for example [1], [2], [6], [7] and [10]. When one assigns a graph to an algebraic structure numerous interesting algebraic problems arise from the translation of some graph-theoretic parameters such as clique number, chromatic number, independence number and so on.…”
Section: Introductionmentioning
confidence: 99%
“…There are many papers on assigning a graph to a ring R, see [1][2][3][4]9,10]. In this paper, we introduce the M-principal graph of R, denoted by M − PG(R), where M is an R-module.…”
Section: Introductionmentioning
confidence: 99%