Abstract
For a finite group [Formula: see text] the superpower graph [Formula: see text] of [Formula: see text] is an undirected simple graph with vertex set [Formula: see text] and two vertices in [Formula: see text] are adjacent in [Formula: see text] if and only if the order of one divides the order of the other in the group [Formula: see text]. In this paper, we give sharp bounds for the vertex connectivity of superpower graphs [Formula: see text] and [Formula: see text] of dihedral group [Formula: see text] and dicyclic group [Formula: see text]
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.
