Maximizing the sum of the squares of the degrees of a graph
type: Item
instance of: scholarly article
title: Maximizing the sum of the squares of the degrees of a graph
zbMATH Open document ID: 1051.05033
published in: Discrete Mathematics
publication date: 2004-08-19T00:00:00Z
review text: The author presents several interesting upper bounds for the sum of the squares of the degrees of a graph, thereby supplementing previous work of \textit{D. de Caen} [Discrete Math. 185, No. 1--3, 245--248 (1998; Zbl 0955.05059)] and \textit{L. A. Székely}, \textit{L. H. Clark} and \textit{R. C. Entringer} [Discrete Math. 103, No. 3, 293--300 (1992; Zbl 0767.05013)].
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 2092822
zbMATH Keywords: Graph
zbMATH Keywords: Degree sequence
zbMATH Keywords: Upper bound
author: Kinkar Ch. Das
reviewed by: Thomas Andreae
MaRDI profile type: Publication
full work available at URL: j.disc.2004.04.007
OpenAlex ID: W2027792620
cites work: An upper bound on the sum of squares of degrees in a graph
cites work: On Sets of Acquaintances and Strangers at any Party
cites work: Q3703916
cites work: Q4276003
cites work: Q5284661
cites work: Sharp upper bounds for the Laplacian graph eigenvalues
cites work: On maximal entries in the principal eigenvector of graphs
cites work: An inequality for degree sequences
DOI: 10.1016/J.DISC.2004.04.007
description: scientific article; zbMATH DE number 2092822