On the Connectivity of Enhanced Power Graphs of Finite Groups

Autor:	Hiranya Kishore Dey, Sajal Kumar Mukherjee, Sudip Bera
Rok vydání:	2021
Předmět:	Combinatorics Vertex connectivity Discrete Mathematics and Combinatorics Abelian group Special class Upper and lower bounds Graph Theoretical Computer Science Mathematics Power (physics)
Zdroj:	Graphs and Combinatorics. 37:591-603
ISSN:	1435-5914 0911-0119
DOI:	10.1007/s00373-020-02267-5
Popis:	This paper deals with the vertex connectivity of enhanced power graphs of finite groups. We classify all abelian groups G such that the vertex connectivity of enhanced power graph of G is 1. We derive an upper bound for the vertex connectivity of the enhanced power graph of any general abelian group G. Also we completely characterize all abelian groups G, such that the proper enhanced power graph is connected. Moreover, we study some special class of non-abelian groups G such that the proper enhanced power graph is connected and we find their vertex connectivity.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::f3e245f27a4bf8134dc76134fc42aaab https://doi.org/10.1007/s00373-020-02267-5 Zobrazit plný text záznamu Plný text ve formátu PDF