On maximal distances in a commuting graph
classification
🧮 math.RA
keywords
commutingdistancesmaximalgraphmatricesalgebraicallyalgebrasattained
read the original abstract
We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe rank-one and semisimple matrices using the distances in the commuting graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.