ON THE SUPER CONNECTIVITY OF DIRECT PRODUCT OF GRAPHS

Abstract

A vertex-cut S is called a super vertex-cut if G - S is disconnected and it contains no isolated vertices. The super-connectivity, k′, is the minimum cardinality over all super vertex-cuts. This article provides bounds for the super connectivity of the direct product of an arbitrary graph and the complete graph Kn. Among other results, we show that if G is a non-complete graph with girth(G) = 3 and k′(G) = ∞, then k′(G × Kn) ≤ min{mn - 6, m(n - 1) + 5, 5n + m - 8}, where |V (G)| = m.