On the connectivity of enhanced power graph of finite group
Combinatorics
2020-07-08 v1
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.
Keywords
Cite
@article{arxiv.2007.03217,
title = {On the connectivity of enhanced power graph of finite group},
author = {Sudip Bera and Hiranya Kishore Dey and Sajal Kumar Mukherjee},
journal= {arXiv preprint arXiv:2007.03217},
year = {2020}
}
Comments
12 pages, 0 figures