Graphs defined by orthogonality. (Q906822)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs defined by orthogonality. |
scientific article; zbMATH DE number 6537355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs defined by orthogonality. |
scientific article; zbMATH DE number 6537355 |
Statements
Graphs defined by orthogonality. (English)
0 references
29 January 2016
0 references
Let \(R\) be an associative ring with identity. The vertex set of the orthogonal graph of the ring \(R\) consists of all nonzero two-sided zero-divisors of \(R\). Moreover, two vertices \(r_1,r_2\in R\) are connected by an edge iff \(r_1r_2=r_2r_1=0\), i.e. \(r_1\) and \(r_2\) are orthogonal. In this paper, properties of the orthogonal graphs of the full matrix algebra and other matrix sets are studied.
0 references
associative rings
0 references
commutative rings
0 references
matrix rings
0 references
orthogonal graphs of rings
0 references
zero divisor graphs
0 references
commuting graphs
0 references
orthogonality graphs
0 references
0 references
0.8401569724082947
0 references
0.8372632265090942
0 references
0.782437264919281
0 references
0.776507556438446
0 references
0.7762733697891235
0 references
