Abstract
The enhanced power graph of a group is a graph with vertex set 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 is any finite group, and then determine them when is a finite abelian -group, , the dihedral group , or the semidihedral group . If 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 . 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.