Abstract
Given a 2-generated finite group G, the non-generating graph of G has as vertices the elements of G and two vertices are adjacent if and only if they are distinct and do not generate G. We consider the graph Sigma (G) obtained from the non-generating graph of G by deleting the universal vertices. We prove that if the derived subgroup of G is not nilpotent, then this graph is connected, with diameter at most 5. Moreover, we give a complete classification of the finite groups G such that Sigma (G) is disconnected.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
