Neighborhood complexes and Kronecker double coverings
arXiv:1404.1549
Abstract
The neighborhood complex is a simplicial complex assigned to a graph whose connectivity gives a lower bound for the chromatic number of . We show that if the Kronecker double coverings of graphs are isomorphic, then their neighborhood complexes are isomorphic. As an application, for integers and greater than 2, we construct connected graphs and such that but and . We also construct a graph such that and the Kneser graph are not isomorphic but their Kronecker double coverings are isomorphic.
arXiv comment10 pages. Some results concerning box complexes are deleted. to appear in Osaka J. Math