Connectivity of Kronecker products by K2
Abstract
Let (G) be the connectivity of G. The Kronecker product G1× G2 of graphs G1 and G2 has 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 (G× K2)=min\2(G), min\|X|+2|Y|\\, where the second minimum is taken over all disjoint sets X,Y⊂eq V(G) satisfying (1)G-(X Y) has a bipartite component C, and (2) G[V(C) \x\] is also bipartite for each x∈ X.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.