The sum of the squares of degrees: Sharp asymptotics

被引：24
|
作者：
Nikiforov, Vladimir [1 ]
机构：
[1] Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA
来源：
DISCRETE MATHEMATICS | 2007年 / 307卷 / 24期
关键词：
squares of degrees; de Caen's bound;
D O I：
10.1016/j.disc.2007.03.019
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let f (n, m) be the maximum of the sum of the squares of degrees of a graph with n vertices and ill edges. Summarizing earlier research, we present a concise, asymptotically sharp upper bound on f (n, m), better than the bound of de Caen for almost all n and m. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：3187 / 3193
页数：7
相关论文
共 50 条
12345