In this article, we consider the bipartite graphs K2×KnK2×Kn. We first show that the connectedness of N(Kn+1Kn)=0N(Kn+1Kn)=0. Further, we show that Hom(K2×Kn,Km)Hom(K2×Kn,Km) is homotopic to Sm−2Sm−2, if 2≤m<n2≤m<n.
生成讲解博客的中文版本
生成AI智能校验的中文版本