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.
机构:
Huaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R ChinaHuaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R China