• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1405-1417
• /
• 2018

The aim of this work is to introduce several different volume computational methods of graph polytopes associated with various types of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and most useful to compute the volume of the graph polytope for an arbitrary finite simple graph.

• Honam Mathematical Journal
• /
• v.38 no.1
• /
• pp.71-84
• /
• 2016

The aim of this work is to compute the volume of the graph polytope associated with various type of finite simple graphs composed of paths and stars. Recurrence relations are obtained using the recursive volume formula (RVF) which was introduced in Lee and Ju ([3]). We also discussed the relationship between the volume of the graph polytopes and the number of linear extensions of the associated posets for given bipartite graphs.

• Honam Mathematical Journal
• /
• v.39 no.1
• /
• pp.41-47
• /
• 2017

The aim of this short paper is to give a new necessary and sufficient condition, topological in nature, for certain real toric manifolds to be orientable in terms of the connectedness of their particular submanifolds of codimension zero.