Super connectivity of lexicographic product graphs

Abstract

For a graph $G$, $k(G)$ denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also $k_1$-connectivity of a connected graph is the minimum number of vertices whose deletion gives a disconnected graph without isolated vertices. This paper provides bounds for the super connectivity and $k_1$-connectivity of the lexicographic product of two graphs.