Abstract
In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds for arbitrary finite groups.
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.
