Bulletin of the
Korean Mathematical Society
BKMS
Article
ALL ARTICLES
View
Bull. Korean Math. Soc. 2018; 55(5): 1405-1417
Online first article March 8, 2018 Printed September 30, 2018
https://doi.org/10.4134/BKMS.b170821
Copyright © The Korean Mathematical Society.
Different volume computational methods of graph polytopes
Hyeong-Kwan Ju, Sangwook Kim, Daeseok Lee
Chonnam National University, Chonnam National University, KAIST
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.
Keywords: graph polytope, volume, generating function
MSC numbers: 05C22, 52B05
Article Tools
Stats or Metrics
Share this article on :
Related articles in BKMS
-
Fixed-width partitions according to the parity of the even parts
2023; 60(4): 1017-1024
-
An extension of Schneider's characterization theorem for ellipsoids
2023; 60(4): 905-913
-
Further results on biases in integer partitions
2022; 59(1): 111-117
-
Some properties of the Bernoulli numbers of the second kind and their generating function
2018; 55(6): 1909-1920
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd