References
- 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
- 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
- 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
- R. Hirschfelder and J. Hirschfelder, Introduction to discrete mathematics, Brooks/Cole(1991).
- S. Lipschutz, Discrete mathematics, McGraw-Hill, New York(2003).
- 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
- D. Olpp, A conjecture of Goodman and the multiplicities of graphs, Austral. J. Combin. 14(1996), 267–282.
- B. Reznick, On the absence of uniform denominators in Hilbert's 17th problem, Proc. Amer. Math. Soc. 133(2005), 2829–2834.
- R. Skvarcius and W. B. Robinson, Discrete mathematics with computer science applications, Kyung Moon Publishers, Korea(1986).
- 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