The diameter of the generating graph of a finite soluble group
Abstract
Let G be a finite 2-generated soluble group and suppose that a1,b1= a2,b2=G. If either G is of odd order or G is nilpotent, then there exists b ∈ G with a1,b= a2,b=G. We construct a soluble 2-generated group G of order 210· 32 for which the previous result does not hold. However a weaker result is true for every finite soluble group: if a1,b1= a2,b2=G, then there exist c1, c2 such that a1, c1 = c1, c2 = c2, a2=G.
0