The connectivity of the normalizing and permuting graph of a finite soluble group

We introduce the normalising graph of a group and study the connectivity of the normalising and permuting graphs of a group when the group is finite and soluble. In particular, we classify finite soluble groups with disconnected normalising graph. The main results shows that if a finite soluble group has connected normalising graph then this graph has diameter at most \(6\). Furthermore, this bound is tight. A corollary then presents the connectivity properties of the permuting graph.