Homotopy type of the neighborhood complexes of graphs of maximal degree at most 3 and 4-regular circulant graphs

Abstract

To estimate the lower bound for the chromatic number of a graph G, Lov\'asz associated a simplicial complex N(G) called the neighborhood complex and relates the topological connectivity of N(G) to the chromatic number of G. More generally he proved that the chromatic number of G is bounded below by the topological connectivity of N(G) plus 3. In this article, we consider the graphs of maximal degree at most 3 and 4-regular circulant graphs. We show that each connected component of the neighborhood complexes of these graphs is homotopy equivalent either to a point, to a wedge sum of circles, to a wedge sum of 2-spheres S2, to S3, to a garland of 2-spheres S2 or to a connected sum of tori.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…