The commuting graph of a soluble group

By Chris Parker. 2012

50 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/7b4b08e01f767a254f94f07c821d5d6dcbec9ab2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. G. L. Morgan
2. Chris Parker

In Discrete Mathematics and Combinatorics

1. G. L. Morgan
2. Chris Parker

In Electrical and Electronic Engineering

1. G. L. Morgan
2. Chris Parker

Citations in the corpus

• The diameter of the commuting graph of a finite group with trivial centre (2013, background): “Their easy proofs can be found in [20] (as well as many other places).”