The complement of a connected bipartite graph is vertex decomposable

Details The complement of a connected bipartite graph is vertex decomposable The complement of a connected bipartite graph is vertex decomposable

2009-02-25

arxiv.org/abs/0902.4342v1

Mathematics

Commutative Algebra

5 pages

Scientific paper

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We are interested in determining what families of graph have the property that the complement of $G$, denoted by $\overline{G}$, is vertex decomposable. We obtain the result that the complement of a connected bipartite graph is vertex decomposable and so it is Cohen-Macaulay due to pureness of $\Delta_{\overline{G}}$.

Affiliated with

Also associated with

No associations

Rating

The complement of a connected bipartite graph is vertex decomposable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complement of a connected bipartite graph is vertex decomposable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complement of a connected bipartite graph is vertex decomposable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157760