The commuting graph of a soluble group
classification
🧮 math.GR
keywords
graphcommutingsolublecentrediametergrouptrivialdisconnected
read the original abstract
The commuting graph of a finite soluble group with trivial centre is investigated. It is shown that the diameter of such a graph is at most 8 or the graph is disconnected. Examples of soluble groups with trivial centre and commuting graph of diameter 8 are provided.
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.