A relationship between bounds on the sum of squares of degrees of a graph (Q2504092): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 08:23, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A relationship between bounds on the sum of squares of degrees of a graph |
scientific article |
Statements
A relationship between bounds on the sum of squares of degrees of a graph (English)
0 references
22 September 2006
0 references
Let \(G\) be a simple graph on \(n\) vertices and \(e\) edges, with degree sequence \(d_1,d_2,\dots,d_n\). Let \(m_i\) denote the average of the degrees of vertices adjacent to vertex \(i\). The work of \textit{D. de Caen} [Discrete Math. 185, 245--248 (1998; Zbl 0955.05059)] and \textit{K. C. Das} [Discrete Math. 285, 57--66 (2004; Zbl 1051.05033)] combined states that \(4e^2/n\leq \sum_i d_i^2 \leq e\cdot \max_j \{d_j+m_j\}\leq e({2e\over n-1}+n-2).\) The present paper studies some cases when equality holds in these inequalities. The paper overlooks that the characterization of equality in the first inequality easily follows from the fact that we know when the Cauchy-Schwarz inequality holds with equality.
0 references
degree sequence
0 references
bipartite graph
0 references