Super connectivity of lexicographic product graphs

Khalid Kamyab, Mohsen Ghasemi, Rezvan Varmazyar

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 mi…