Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
A graph G is super connected, or simply super-κ, if every minimum vertex-cut isolates a vertex. The Kronecker product G1 × G2 of graphs G1 and G2 is the graph with vertex set V (G1 × G2) = V(G1) × V (G2) and edge set E(G1 × G2) = {(u1,v1)(u2,v2): u1u2 ∈ E(G1),v1v2 ∈ E(G2)}. In this paper, we prove that Pm × Cn is super-κ for m≥4, n≥3 and n is odd; Cm × Cn is super-κ for m≥5, n≥3 and n is odd.
Comments on this article