A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
The enhanced power graph 𝒫_E(G) of a finite group G is the simple undirected graph whose vertex set is G and two distinct vertices x, y are adjacent if x, y ∈⟨ z ⟩ for some z ∈ G. In this article, we give an affirmative answer of the question posed by Cameron  which states that: Is it true that the complement of the enhanced power graph 𝒫̅_̅E̅(̅G̅)̅ of a non-cyclic group G has only one connected component apart from isolated vertices? We classify all finite groups G such that the grapharXiv:2207.04641v1 fatcat:crhjdl7cebhv3fphqo7jfv5sym