On the connectivity of enhanced power graph of finite group (2007.03217v1)
Abstract: This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G is 1. We derive an upper bound of vertex connectivity for the enhanced power graph of any general abelian group G. Also we completely characterize all abelian group G, such that the proper enhanced power graph is connected. Moreover, we study some special class of non-abelian group G such that the proper enhanced power graph is connected and we find their vertex connectivity.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.