Maximizing the sum of the squares of the degrees of a graph (Q1877650)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximizing the sum of the squares of the degrees of a graph |
scientific article; zbMATH DE number 2092822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the sum of the squares of the degrees of a graph |
scientific article; zbMATH DE number 2092822 |
Statements
Maximizing the sum of the squares of the degrees of a graph (English)
0 references
19 August 2004
0 references
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)].
0 references
Graph
0 references
Degree sequence
0 references
Upper bound
0 references
0.8719196319580078
0 references
0.8586040735244751
0 references
0.8584242463111877
0 references
0.8573614954948425
0 references
