An upper bound on the sum of squares of degrees in a graph

Discrete Mathematics

Volumn 185, Issue 1-3, 1998, Pages 245-248

  De Caen, D ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037904600     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00213-6     Document Type: Article

References (5)

1. A.W. Goodman, On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959) 778-783.
2. A.W. Goodman, Triangles in a complete chromatic graph, J. Austral. Math. Soc. Ser. A 39 (1985) 86-93.
3. L. Lovász, Combinatorial Problems and Exercises, 2nd ed., North-Holland, Amsterdam, 1993.
4. D. Olpp, A conjecture of Goodman and the multiplicities of graphs, Austral. J. Combin. 14 (1996) 267-282.
5. L.A. Székely, L.H. Clark, R.C. Entringer, An inequality for degree sequences, Discrete Math. 103 (1992) 293-300.