Commuting graphs and extremal centralizers

14Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra M n(F) over an arbitrary field F. It is known that if F is an algebraically closed field and n ≥ 3, then the diameter of the commuting graph of Mn(F) is always equal to four. We construct a concrete example showing that if F is not algebraically closed, then the commuting graph of Mn(F) can be connected with the diameter at least five. Copyright © 2014 DMFA Slovenije.

Cite

CITATION STYLE

APA

Dolinar, G., Guterman, A., Kuzma, B., & Oblak, P. (2014). Commuting graphs and extremal centralizers. Ars Mathematica Contemporanea, 7(2), 453–459. https://doi.org/10.26493/1855-3974.386.a83

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free