Connectivity of superpower graphs of some non-abelian finite groups

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]