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 look for conditions on the positive integer m that ensure that Γ ( G ) contains a Hamiltonian cycle when G = S ≀ C m is the wreath product of a finite simple group S and a cyclic group of order m.
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.
