English

Neighborhood Complexes of Some Exponential Graphs

Combinatorics 2017-09-18 v1

Abstract

In this article, we consider the bipartite graphs K2×KnK_2 \times K_n. We first show that the connectedness of N(Kn+1Kn)=0\mathcal{N}(K_{n+1}^{K_n}) =0. Further, we show that Hom(K2×Kn,Km)\text{Hom}(K_2 \times K_{n}, K_{m}) is homotopic to Sm2S^{m-2}, if 2m<n2\leq m <n.

Cite

@article{arxiv.1709.05263,
  title  = {Neighborhood Complexes of Some Exponential Graphs},
  author = {Nandini Nilakantan and Samir Shukla},
  journal= {arXiv preprint arXiv:1709.05263},
  year   = {2017}
}

Comments

19 pages. arXiv admin note: text overlap with arXiv:1702.03527

R2 v1 2026-06-22T21:44:32.754Z