Super connectivity of a family of direct product graphs

Abstract

Let and be two graphs. The Kronecker product has vertex set and the edge set In this paper we show that if is a complete multipartite graph, where the parameters satisfying certain conditions and is a path of length n−1, then is not super i-connected, where and . Also we show that is not super connected, where is a cycle of length n and .