Commuting graphs of some subsets in simple rings (Q2496665)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5042153
Language Label Description Also known as
default for all languages
No label defined
    English
    Commuting graphs of some subsets in simple rings
    scientific article; zbMATH DE number 5042153

      Statements

      Commuting graphs of some subsets in simple rings (English)
      0 references
      0 references
      20 July 2006
      0 references
      Let \(D\) be a division ring with center \(F\) and \(n\geq1\) a natural number. For \(S\subseteq M_n(D)\) the commuting graph of \(S\), denoted by \(\Gamma(S)\), is the graph with vertex set \(S\setminus Z(S)\) such that distinct vertices \(a\) and \(b\) are adjacent if and only if \(ab=ba\). In this paper we prove that if \(n>2\) and \({\mathcal A}\), \({\mathcal N}\), \({\mathcal I}\), \({\mathcal T}\) are the sets of all non-invertible, nilpotent, idempotent matrices, and involutions, respectively, then for any division ring \(D\), \(\Gamma({\mathcal A})\), \(\Gamma({\mathcal N})\), \(\Gamma({\mathcal I})\), and \(\Gamma({\mathcal T})\) are connected graphs. We show that if \(n> 2\) and \({\mathcal U}\) is the set of all upper triangular matrices, then for every algebraic division ring \(D\), \(\Gamma({\mathcal U})\) is a connected graph. Also it is shown that if \({\mathcal R}\) is the set of all reducible matrices and \(M_n(D)\) is algebraic over \(F\), then for \(n>2\), \(\Gamma({\mathcal R})\) is a connected graph. Finally, we prove that for \(n\geq 2\), \(\Gamma(M_n({\mathbb H}))\) is a connected graph, where \(\mathbb H\) is the ring of real quaternions.
      0 references
      commuting graph
      0 references
      simple ring
      0 references
      division ring
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers