References
- M. Beck and S. Robins, Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra. Undergraduate Texts in Mathematics. Springer, New York (2007). Electronically available at http://math.sfsu.edu/beck/ccd.html.
- M. Bona and H.-K. Ju, Enumerating solutions of a system of linear inequalities related to magic squares, Ann. Combin. 10(2006) 179-191. https://doi.org/10.1007/s00026-006-0281-y
- M. Bona, H.-K. Ju and R. Yoshida, On the enumeration of a certain weighted graphs, Discrete Applied Math., 155(2007) 1481-1496. https://doi.org/10.1016/j.dam.2007.04.001
-
N. Elkies, On the sums
${\Sigma}^{\infty}_k=_{-\infty}(4k+1)^{-n}$ , Amer. Math. Monthly 110, no. 7(Aug.-Sep. 2003), 561-573. https://doi.org/10.2307/3647742 - D. Lee and H.-K. Ju, Different volume computation methods of graph polytopes, Preprint (arXiv:1507.07623v1 [math.CO]), 2015.
- H.-K. Ju, Enumeration of weighted complete graphs, J. Korean Math. Soc. 44(2007), 1351-1621. https://doi.org/10.4134/JKMS.2007.44.6.1351
- The On-Line Encyclopedia of Integer Sequences, published electronically at http://oeis.org.
- W. Rudin, Principles of mathematical analysis (3rd ed.), McGraw-Hill, 1976.
- R. Stanley, A Survey of alternating permutations, Contemporary Mathematics 531 (2010), 165-196. https://doi.org/10.1090/conm/531/10466
- H.-J. Woo, On the enumeration of weighted tree of certain types and volumes of the associated graph polytopes, Chonnam National Univ., Feb. 2014.
Cited by
- VOLUME OF GRAPH POLYTOPES FOR THE PATH-STAR TYPE GRAPHS vol.38, pp.1, 2016, https://doi.org/10.5831/HMJ.2016.38.1.71