Connectivity of Kronecker products by K2
arXiv:1106.1255
Abstract
Let be the connectivity of . The Kronecker product of graphs and has vertex set and edge set . In this paper, we prove that , where the second minimum is taken over all disjoint sets satisfying (1) has a bipartite component , and (2) is also bipartite for each .
6 pages