arXiv Analytics

Sign in

arXiv:1106.1255 [math.CO]AbstractReferencesReviewsResources

Connectivity of Kronecker products by K2

Wei Wang, Zhidan Yan

Published 2011-06-07Version 1

Let $\kappa(G)$ be the connectivity of $G$. The Kronecker product $G_1\times G_2$ of graphs $G_1$ and $G_2$ has vertex set $V(G_1\times G_2)=V(G_1)\times V(G_2)$ and edge set $E(G_1\times G_2)=\{(u_1,v_1)(u_2,v_2):u_1u_2\in E(G_1),v_1v_2\in E(G_2)\}$. In this paper, we prove that $\kappa(G\times K_2)=\textup{min}\{2\kappa(G), \textup{min}\{|X|+2|Y|\}\}$, where the second minimum is taken over all disjoint sets $X,Y\subseteq V(G)$ satisfying (1)$G-(X\cup Y)$ has a bipartite component $C$, and (2) $G[V(C)\cup \{x\}]$ is also bipartite for each $x\in X$.

Comments: 6 pages
Categories: math.CO
Subjects: 05C40, 05C40
Related articles: Most relevant | Search more
arXiv:0906.3946 [math.CO] (Published 2009-06-22)
The rainbow $k$-connectivity of two classes of graphs
arXiv:1805.08461 [math.CO] (Published 2018-05-22)
The restricted $h$-connectivity of balanced hypercubes
arXiv:2306.15301 [math.CO] (Published 2023-06-27)
Connectivity of 2-distance graphs