본문 바로가기
KERD
논문KCI 등재

Different volume computational methods of graph polytopes

0

조회

0

다운로드

1

인용

0

참고문헌

키워드

주제분류수학

초록

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.

Abstract

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.

참고문헌 (7)

  1. M. Beck, "Computing the Continuous Discretely, Undergraduate Texts in Mathematics" (2007), Springer
  2. M. Bona, "On the enumeration of certain weighted graphs", Discrete Appl. Math., 155(11), pp.1481~1496 (2007)[DOI]
  3. N. D. Elkies, "On the sums <TEX>${\Sigma}^{\infty}_{{\kappa}=-{\infty}(4k+1)^{-n}$<", TEX>, 2003, pp.110(7), 561~573
  4. V. Hutson, "Applications of Functional Analysis and Operator Theory, second edition, Mathematics in Science and Engineering, 200" (2005), Elsevier B. V.
  5. 주형관, "On the Volume of Graph Polytopes", 호남수학학술지, 37(3), pp.361~376 (2015), 호남수학회
  6. W. Rudin, "Principles of Mathematical Analysis, third edition" (1976), McGraw-Hill Book Co.
  7. R. P. Stanley, "Enumerative Combinatorics. Volume 1, second edition, Cambridge Studies in Advanced Mathematics, 49" (2012), Cambridge University Press

관련 논문AI추천

이 간행물의 다른 논문 (21건)