Journal of the Korean Mathematical Society (대한수학회지)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

ENUMERATION OF WEIGHTED COMPLETE GRAPHS

  • Published : 2007.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

We enumerate the number of weighted complete graphs and compute its generating function.

Keywords

References

  1. M. Bona, Walk Through Combinatorices, World Scientific, 2002
  2. M. Bona, Combinatorics of Permutations, Chapman & Hall /CRC, 2004
  3. M. Bona and H.-K. Ju, Enumerating Solutions of a System of Linear Inequalities Related to Magic Squares, Annals of Combinatorcs 10 (2006), no. 2, 179-191 https://doi.org/10.1007/s00026-006-0281-y
  4. M. Bona, H.-K. Ju, and R. Yoshida, On the Enumeration of Certain Weghted Graphs, Discrete Appl. Math. 155 (2007), 1481-1496 https://doi.org/10.1016/j.dam.2007.04.001
  5. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics 2nd ed., Addison Wesley, 1994
  6. H.-K. Ju, Ennumerating Solutions of BJ-problems for the Complete Graphs $K_4\;and\;K_5$, Korean Annals of Math. 22 (2005), no. 2, 173-188
  7. R. Stanley, Enumerative Combinatorices, vol.1, Cambridge University Press, 1999

Cited by

  1. ON THE VOLUME OF GRAPH POLYTOPES vol.37, pp.3, 2015, https://doi.org/10.5831/HMJ.2015.37.3.361
  2. On the enumeration of certain weighted graphs vol.155, pp.11, 2007, https://doi.org/10.1016/j.dam.2007.04.001