| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655069 | Journal of Combinatorial Theory, Series A | 2016 | 9 Pages |
Abstract
The commuting graph of a semigroup is the set of non-central elements; the edges are defined as pairs (u,v)(u,v) satisfying uv=vuuv=vu. We provide an example of a field FF and an integer n such that the commuting graph of Matn(F)Matn(F) has maximal possible diameter, equal to six.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yaroslav Shitov,