Diameter of the commuting graph of $\mathbb{R}^{n\times n}$
Combinatorics
2015-01-05 v1
Abstract
The vertices of commuting graph of are non-scalar matrices; the edges are defined as pairs satisfying . For , the diameter of this graph is at least four; we give a short proof that it is exactly four.
Cite
@article{arxiv.1501.00167,
title = {Diameter of the commuting graph of $\mathbb{R}^{n\times n}$},
author = {Yaroslav Shitov},
journal= {arXiv preprint arXiv:1501.00167},
year = {2015}
}
Comments
note, 1 page