Let k be a positive integer. A graph G = (V, E) is said to be Пek - connected if for any given edge subset F of E(G) with | F| = k, the subgraph induced by F is connected. In this paper, we explore the minimality conditions on Пekconnectedness of a graph and also its properties of prism and corona graphs are obtained.