(n,e)-Graphs with maximum sum of squares of degrees*

Abstract

Among all simple graphs on n vertices and e edges, which ones have the largest sum of squares of the vertex degrees? It is easy to see that they must be threshold graphs, but not every threshold graph is optimal in this sense. Boesch et al. [Boesch et al., Tech Rep, Stevens Inst Tech, Hoboken NJ, 1990] showed that for given n and e there exists exactly one graph of the form G 1 (p, q, r) = K p + (S q ∪ K 1,r ) and exactly one G 2 (p, q, r) = S p ∪ (K q + K 1,r ) and that one of them is optimal, where K and S indicate complete and edgeless graphs, K 1,r indicates a star on r + 1 vertices, ∪ indicates disjoint union, and + indicates complete disjoint join. We specify a general threshold graph in the form G *or its complement * Part of this research was conducted while the first author was visiting the University of Rome "La Sapienza" and theÉcole Polytechnique Fédérale de Lausanne, whose support is gratefully acknowledged.

Degree-Based Topological Indices

“…[43][44][45][46][47][48] Results obtained in the theory of Zagreb indices are summarized in the reviews. [49][50][51][52] The chemical aspects of M 1 and M 2 are outlined in the reviews.…”

Extremal graphs for homomorphisms

“…See, for instance, [5]. 1 It was shown by Peled, Petreschi, and Sterbini in [19] that every d2-extremal graph is of the form…”

Network Formation with Local Complements and Global Substitutes: The Case of R&D Networks

“…Both, the complete graph, K n , as well as the star K 1,n−1 , are particular examples of nested split graphs. Nested split graphs are also the graphs which maximize the largest eigenvalue, λ PF (G), [Brualdi and Solheid, 1986], and they are the ones that maximize the degree variance [Peled et al, 1999]. See e.g.…”