Maximizing the sum of the squares of the degrees of a graph

Discrete Mathematics

Volumn 285, Issue 1-3, 2004, Pages 57-66

  Das, Kinkar Ch ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Degree sequence; Graph; Upper bound

Indexed keywords

ASYMPTOTIC STABILITY; FINITE DIFFERENCE METHOD; THEOREM PROVING;

DEGREE SEQUENCE; EXTREMAL GRAPHS; UPPER BOUND;

GRAPH THEORY;

EID: 3142641184     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.04.007     Document Type: Article

References (9)

1. de Caen D. An upper bound on the sum of squares of degrees in a graph. Discrete Math. 185:1998;245-248.
2. Z. Füredi, A. Kündgen, Monotone families have their moments, manuscript.
3. Goodman A.W. On sets of acquaintances and strangers at any party. Amer. Math. Monthly. 66:1959;778-783.
4. Goodman A.W. Triangles in a complete chromatic graph. J. Austral. Math. Soc. Ser. A. 39:1985;86-93.
5. Lovász L. Combinatorial Problems and Exercises. 2nd Edition:1993;North-Holland, Amsterdam.
6. Olpp D. A conjecture of Goodman and the multiplicities of graphs. Austral. J. Combin. 14:1996;267-282.
7. Pan Y.-L. Sharp upper bounds for the Laplacian graph eigenvalues. Linear Algebra Appl. 355:2002;287-295.
8. Papendieck B., Recht P. On maximal entries in the principal eigenvector of graphs. Linear Algebra Appl. 310:2000;129-138.
9. Székely L.A., Clark L.H., Entringer R.C. An inequality for degree sequences. Discrete Math. 103:1992;293-300.