Extremal graphs for weights

被引：85

作者：

Bollobás, B

Erdos, P

Sarkar, A

机构：

[1] Memphis State Univ, Dept Math Sci, Memphis, TN 38152 USA

[2] Hungarian Acad Sci, Inst Math, H-1053 Budapest, Hungary

[3] Univ Cambridge Trinity Coll, Cambridge CB2 1TQ, England

来源：

DISCRETE MATHEMATICS | 1999年 / 200卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(98)00320-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Given a graph G = (V,E) and alpha is an element of R, we write w(alpha)(G) = Sigma(xy is an element of E) d(G)(x)(alpha)d(G)(y)(alpha), and study the function w(alpha)(m) = max{w(alpha)(G): e(G) = m}. Answering a question from Bollobas and Erdos (Graphs of external weights, to appear), we determine w(1)(m) for every m, and we also give bounds for the case alpha not equal 1. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：5 / 19

页数：15