Extremal graphs for weights
Abstract
Given a graph G = (V,E) and α ∈ ℝ, we write Wα(G) = ∑xy∈E dG(X)αdG(y)α and study the function wα(m)= max{wα(G): e(G) = m}. Answering a question from Bollobás and Erdos (Graphs of external weights, to appear), we determine w1(m) for every m, and we also give bounds for the case α ≠ 1. © 1999 Elsevier Science B.V. All rights reserved.
Publication Title
Discrete Mathematics
Recommended Citation
Bollobás, B., Erdos, P., & Sarkar, A. (1999). Extremal graphs for weights. Discrete Mathematics, 200 (1-3), 5-19. https://doi.org/10.1016/S0012-365X(98)00320-3
COinS
