Maximizing the sum of the squares of the degrees of a graph (Q1877650): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.04.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027792620 / rank | |||
Normal rank | |||
Revision as of 20:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing the sum of the squares of the degrees of a graph |
scientific article |
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
