arXiv · 1009.5543
On maximal distances in a commuting graph
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gregor Dolinar, Bojan Kuzma, Polona Oblak. 2010-09-28. On maximal distances in a commuting graph. https://arxiv.org/abs/1009.5543
Cite the original work for its findings. Save a collection to share your selection of sources.