Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

SOME CONSIDERATIONS ABOUT UPPER BOUNDS ON THE SUM OF SQUARES OF DEGREES

  • Kim, Hwa-Joon (Department of Computer Science in Asian Institute of Technology, Department of Computational Mathematics in Rangsit University) ;
  • Supratid, S. (Department of Computer Science in Asian Institute of Technology, Department of Computational Mathematics in Rangsit University) ;
  • Kitbmrungrat, K. (Department of Computer Science in Asian Institute of Technology, Department of Computational Mathematics in Rangsit University) ;
  • Liemmance, W. (Department of Computer Science in Asian Institute of Technology, Department of Computational Mathematics in Rangsit University) ;
  • Julraksa, N. (Department of Computer Science in Asian Institute of Technology, Department of Computational Mathematics in Rangsit University)
  • 발행 : 2009.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Goodman([3]) presented the question of finding a best possible upper bound of the form $t(G)\;+\;t(G^c)$, where t(G) denote the number of triangles in given graph G. In this, the form of squares of degrees is appeared and many researches have been pursued as an application related to this. Here, we would like to deal with corollary related to the results of Nikiforov([6]).

키워드

참고문헌

  1. D. de. Caen, An upper bound on the sum of squares of degrees in a graph, Discrete Math. 185(1998), 245–248. https://doi.org/10.1016/S0012-365X(97)00213-6
  2. K. Ch. Das, Maximizing the sum of the squares of the degrees of a graph, Discrete Math. 285(2004), 57–66. https://doi.org/10.1016/j.disc.2004.04.007
  3. A. W. Goodman, Triangles in a complete chromatic graph, J. Austral. Math. Soc. Ser. A 39(1985), 86–93. https://doi.org/10.1017/S1446788700022199
  4. R. Hirschfelder and J. Hirschfelder, Introduction to discrete mathematics, Brooks/Cole(1991).
  5. S. Lipschutz, Discrete mathematics, McGraw-Hill, New York(2003).
  6. V. Nikiforov, The sum of squares of degrees: an overdue assignment, Discrete Math. 307(2007), 3187–3193. https://doi.org/10.1016/j.disc.2007.03.019
  7. D. Olpp, A conjecture of Goodman and the multiplicities of graphs, Austral. J. Combin. 14(1996), 267–282.
  8. B. Reznick, On the absence of uniform denominators in Hilbert's 17th problem, Proc. Amer. Math. Soc. 133(2005), 2829–2834.
  9. R. Skvarcius and W. B. Robinson, Discrete mathematics with computer science applications, Kyung Moon Publishers, Korea(1986).
  10. L. A. Szekely, L. H. Clark and R. C. Entringer, An inequality for degree sequences, Discrete Math. 103(1992) 293–300. https://doi.org/10.1016/0012-365X(92)90321-6