Abstract
For a finite group G, let Γ(G) denote the graph defined on the non-identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. We prove that if G is soluble, then the non-isolated vertices of Γ(G) belong to a unique connected component.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have