On the enhanced power graph of a finite group

Abstract

The enhanced power graph of a group G is a graph with vertex set G and two vertices are adjacent if they belong to the same cyclic subgroup. In this paper, we consider the minimum degree, independence number, and matching number of enhanced power graphs of finite groups. We first study these graph invariants for when G is any finite group and then determine them when G is a finite abelian p-group, the dihedral group or the semidihedral group If G is any of these groups, we prove that is perfect and then obtain its strong metric dimension. Additionally, we give an expression for the independence number of for any finite abelian group G. These results along with certain known equalities yield the edge connectivity, vertex covering number, and edge covering number of enhanced power graphs of the respective groups as well.