Simple polytopes arising from finite graphs

Details Simple polytopes arising from finite graphs Simple polytopes arising from finite graphs

2008-04-27

arxiv.org/abs/0804.4287v1

Mathematics

Commutative Algebra

11 pages

Scientific paper

Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that the toric ideals $I_G$ of $G$ possesses a quadratic Gr\"obner basis if the edge polytope ${\cal P}_G$ of $G$ is simple. It is also shown that, for a finite graph $G$, the edge polytope is simple but not a simplex if and only if it is smooth but not a simplex. Moreover, the Ehrhart polynomial and the normalized volume of simple edge polytopes are computed.

Affiliated with

Also associated with

No associations

Rating

Simple polytopes arising from finite graphs 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 Simple polytopes arising from finite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple polytopes arising from finite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-114540